Sciweavers

6833 search results - page 1138 / 1367
» Some two-character sets
Sort
View
ICDCN
2009
Springer
16 years 1 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
FOCS
2009
IEEE
16 years 1 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
16 years 1 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
INFOCOM
2009
IEEE
16 years 1 months ago
Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks
Abstract—We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may g...
Ji Luo, Dan Wang, Qian Zhang
INFOCOM
2009
IEEE
16 years 1 months ago
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
Eitan Altaian, Philippe Nain, Jean-Claude Bermond
« Prev « First page 1138 / 1367 Last » Next »