457 search results - page 39 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
140
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
276
Voted
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
135
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
140
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
189
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...