Sciweavers

1991 search results - page 82 / 399
» Small Models of Large Machines
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
MOBICOM
2004
ACM
15 years 3 months ago
Using code collection to support large applications on mobile devices
The progress of mobile device technology unfolds a new spectrum of applications that challenges conventional infrastructure models. Most of these devices are perceived by their us...
Lucian Popa 0002, Irina Athanasiu, Costin Raiciu, ...
DATAMINE
2006
127views more  DATAMINE 2006»
14 years 10 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
ICALP
2005
Springer
15 years 3 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu