Results 1 - 10 of 1,958

Privacy Preserving Data Mining

by Yehuda Lindell, Benny Pinkas - JOURNAL OF CRYPTOLOGY , 2000
"... In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated b ..."
Abstract - Cited by 525 (9 self) - Add to MetaCart
In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated

Geography-informed Energy Conservation for Ad Hoc Routing

by Ya Xu, John Heidemann, Deborah Estrin - ACM MOBICOM , 2001
"... We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity. GA ..."
Abstract - Cited by 1045 (21 self) - Add to MetaCart
We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity

Interprocedural optimization: eliminating unnecessary recompilation

by Michael Burke - ACM Transactions on Programming Languages and Systems , 1993
"... While efficient new algorithms for interprocedural data-flow analysis have made these techniques practical for use in production compilation systems,a new problem has arisen: collecting and using interprocedural information in a compiler introduces subtle dependence among the proceduresof a program. ..."
Abstract - Cited by 40 (4 self) - Add to MetaCart
While efficient new algorithms for interprocedural data-flow analysis have made these techniques practical for use in production compilation systems,a new problem has arisen: collecting and using interprocedural information in a compiler introduces subtle dependence among the proceduresof a program

On the reduction of broadcast redundancy in mobile ad hoc networks

by Wei Peng, Xi-cheng Lu
"... Abst rac t- Flooding in mobile ad hoc networks has poor scalability as it leads to serious redundancy, contention and collision. In this paper, we propose an efficient approach to reduce the broadcast redundancy. In our approach, local topology information and the statistical information about the d ..."
Abstract - Cited by 241 (0 self) - Add to MetaCart
Abst rac t- Flooding in mobile ad hoc networks has poor scalability as it leads to serious redundancy, contention and collision. In this paper, we propose an efficient approach to reduce the broadcast redundancy. In our approach, local topology information and the statistical information about

or Unnecessary Increase in Tensions

by Omb No , 2011
"... Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comment ..."
Abstract - Add to MetaCart
Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send

Efficient Algorithms for Discovering Association Rules

by Heikki Mannila, Hannu Toivonen, Inkeri Verkamo , 1994
"... Association rules are statements of the form "for 90 % of the rows of the relation, if the row has value 1 in the columns in set W , then it has 1 also in column B". Agrawal, Imielinski, and Swami introduced the problem of mining association rules from large collections of data, and gave a ..."
Abstract - Cited by 237 (11 self) - Add to MetaCart
a method based on successive passes over the database. We give an improved algorithm for the problem. The method is based on careful combinatorial analysis of the information obtained in previous passes; this makes it possible to eliminate unnecessary candidate rules. Experiments on a university

SPAND: Shared Passive Network Performance Discovery

by Srinivasan Seshan, Mark Stemm, Randy H. Katz - IN USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS , 1997
"... In the Internet today, users and applications must often make decisions based on the performance they expect to receive from other Internet hosts. For example, users can often view many Web pages in low-bandwidth or high-bandwidth versions, while other pages present users with long lists of mirror s ..."
Abstract - Cited by 221 (8 self) - Add to MetaCart
sites to chose from. Current techniques to perform these decisions are often ad hoc or poorly designed. The most common solution used today is to require the user to manually make decisions based on their own experience and whatever information is provided by the application. Previous efforts

Unnecessary Remains a Case of Professional Elite

by Bastiaan Van Loenen, Jaap Zevenbergen, Jitske De Jong, Bastiaan Van Loenen, Jaap Zevenbergen, Jitske De Jong
"... Key words: access policy, spatial information management, geographic information ..."
Abstract - Add to MetaCart
Key words: access policy, spatial information management, geographic information

Unnecessary Competition in Multi-hop Wireless Networks

by Jie Xu, Guofang Tu, Yuming Jiang
"... Abstract—In multi-hop wireless networks, active nodes compete for the sharing channel with nodes in the same range. In this paper, we show that a large fraction of the competition can be seen as unnecessary. In addition, we present that with the aid of routing information, the unnecessary competitio ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract—In multi-hop wireless networks, active nodes compete for the sharing channel with nodes in the same range. In this paper, we show that a large fraction of the competition can be seen as unnecessary. In addition, we present that with the aid of routing information, the unnecessary

CIRCA: The Cooperative Intelligent Real-Time Control Architecture

by David John Musliner
"... The Cooperative Intelligent Real-time Control Architecture (CIRCA) is a novel architecture for intelligent real-time control that can guarantee to meet hard deadlines while still using unpredictable, unrestricted AI methods. CIRCA includes a real-time subsystem used to execute reactive control plans ..."
Abstract - Cited by 180 (49 self) - Add to MetaCart
model of agent/environment interactions. Borrowing approaches from real-time systems research, the world model provides the information required to make real-time performance guarantees, but avoids unnecessary complexity. Using the world model, the AI subsystem develops reactive control plans
Results 1 - 10 of 1,958