Sciweavers

9949 search results - page 1614 / 1990
» On the Network Complexity of Selection
Sort
View
229
Voted
CASES
2006
ACM
16 years 25 days ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
COMPGEOM
2006
ACM
16 years 25 days ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
SIGCOMM
2006
ACM
16 years 24 days ago
MIRO: multi-path interdomain routing
The Internet consists of thousands of independent domains with different, and sometimes competing, business interests. However, the current interdomain routing protocol (BGP) limi...
Wen Xu, Jennifer Rexford
SIGIR
2004
ACM
16 years 8 days ago
On scaling latent semantic indexing for large peer-to-peer systems
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...
Chunqiang Tang, Sandhya Dwarkadas, Zhichen Xu
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
15 years 11 months ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
« Prev « First page 1614 / 1990 Last » Next »