Sciweavers

10148 search results - page 1999 / 2030
» Optimal sub-graphical models
Sort
View
137
Voted
SPAA
2010
ACM
15 years 4 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 4 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
126
Voted
ADHOC
2007
122views more  ADHOC 2007»
15 years 3 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
110
Voted
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
15 years 3 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
161
Voted
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
15 years 3 months ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone
« Prev « First page 1999 / 2030 Last » Next »