Sciweavers

13457 search results - page 108 / 2692
» Can we elect if we cannot compare
Sort
View
AINA
2010
IEEE
14 years 2 months ago
Iterative Route Discovery in AODV
Abstract—Several protocols for ad hoc network try to reduce redundancy as an effective measure against broadcast problems. Though these protocols ensure good performance in a fav...
Nashid Shahriar, Syed Ashker Ibne Mujib, Arup Rato...
TIP
2010
181views more  TIP 2010»
13 years 3 months ago
Cluster-Based Distributed Face Tracking in Camera Networks
In this paper, we present a distributed multicamera face tracking system suitable for large wired camera networks. Unlike previous multicamera face tracking systems, our system doe...
Josiah Yoder, Henry Medeiros, Johnny Park, Avinash...
FCT
2007
Springer
14 years 27 days ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
NIPS
2008
13 years 10 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
WD
2010
13 years 6 months ago
Vicinity resource cartography for delay-tolerant networks: A holistic perspective
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...
Gabriel Sandulescu, Péter Schaffer, Simin N...