Sciweavers

432 search results - page 74 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
ICDCN
2009
Springer
15 years 4 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
ICDCS
1999
IEEE
15 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
100
Voted
TSP
2010
14 years 4 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ECCV
2006
Springer
15 years 11 months ago
Learning to Detect Objects of Many Classes Using Binary Classifiers
Viola and Jones [VJ] demonstrate that cascade classification methods can successfully detect objects belonging to a single class, such as faces. Detecting and identifying objects t...
Ramana Isukapalli, Ahmed M. Elgammal, Russell Grei...
WWW
2009
ACM
15 years 10 months ago
Efficient overlap and content reuse detection in blogs and online news articles
The use of blogs to track and comment on real world (political, news, entertainment) events is growing. Similarly, as more individuals start relying on the Web as their primary in...
Jong Wook Kim, Jun'ichi Tatemura, K. Selçuk...