Sciweavers

32 search results - page 2 / 7
» Multicovering Bounds from Relative Covering Radii
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
EOR
2010
98views more  EOR 2010»
13 years 4 months ago
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
Maria Albareda-Sambola, Juan A. Díaz, Elena...
MOBICOM
2009
ACM
13 years 11 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
RSA
2010
94views more  RSA 2010»
13 years 3 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
COMPGEOM
2005
ACM
13 years 6 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...