2600 search results - page 146 / 520 » Clustering with or without the Approximation |
273
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
241
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
161
click to vote
NOMS
2008
IEEE
16 years 26 days ago
2008
IEEE
—Agent-based virtual private networks architecture (ABVA) refers to the environment where a third-party provider runs and administers remote access VPN service for organizations ...
162
click to vote
HPDC
2007
IEEE
16 years 24 days ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
178
click to vote
ESA
2005
Springer
16 years 3 hour ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...