Sciweavers

1982 search results - page 160 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
PEWASUN
2005
ACM
15 years 9 months ago
Efficient deafness avoidance in wireless ad hoc and sensor networks with directional antennas
Using directional antennas in wireless ad hoc networks can significantly improve network performance. However, the deafness problem greatly limits the network performance. This pa...
Yihu Li, Ahmed M. Safwat
HPDC
1998
IEEE
15 years 8 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
16 years 4 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 5 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 1 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry