Sciweavers

2996 search results - page 244 / 600
» Numberings and Randomness
Sort
View
ROBOCOMM
2007
IEEE
16 years 28 days ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
SIGIR
2006
ACM
16 years 18 days ago
Inferring document relevance via average precision
We consider the problem of evaluating retrieval systems using a limited number of relevance judgments. Recent work has demonstrated that one can accurately estimate average precis...
Javed A. Aslam, Emine Yilmaz
ISVLSI
2005
IEEE
108views VLSI» more  ISVLSI 2005»
16 years 7 days ago
Analysis of a Mask-Based Nanowire Decoder
A key challenge facing nanotechnologies will be controlling nanoarrays, two orthogonal sets of nanowires that form a crossbar, using a moderate number of mesoscale wires. Three me...
Eric Rachlin, John E. Savage, Benjamin Gojman
PPAM
2005
Springer
16 years 4 days ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
INDOCRYPT
2004
Springer
16 years 12 hour ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora