Sciweavers

2466 search results - page 454 / 494
» Algorithms for distributed functional monitoring
Sort
View
WWW
2003
ACM
15 years 10 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
15 years 10 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
SIGCOMM
2010
ACM
14 years 10 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
CVPR
2008
IEEE
15 years 12 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
15 years 10 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson