Sciweavers

9414 search results - page 559 / 1883
» Adaptive Query Processing
Sort
View
149
Voted
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
16 years 10 days ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
ICDCSW
2003
IEEE
16 years 6 days ago
A Scalable Hash-Based Mobile Agent Location Mechanism
In this paper, we propose a novel mobile agent tracking mechanism based on hashing. To allow our system to adapt to variable workloads, dynamic rehashing is supported. The propose...
Georgia Kastidou, Evaggelia Pitoura, George Samara...
ICALP
2003
Springer
16 years 4 days ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
NIPS
2004
15 years 8 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 8 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...