Sciweavers

2168 search results - page 197 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
152
Voted
LICS
2006
IEEE
15 years 9 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
253
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
126
Voted
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 9 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
123
Voted
ECCV
2006
Springer
16 years 5 months ago
Feature Harvesting for Tracking-by-Detection
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
Mustafa Özuysal, Vincent Lepetit, Franç...
127
Voted
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 10 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom