Sciweavers

1208 search results - page 47 / 242
» On Counting Generalized Colorings
Sort
View
PODC
2006
ACM
14 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
CHI
2004
ACM
14 years 9 months ago
Link colors guide a search
While much basic research exists on the effects of various visual properties on visual search, the application of such research to real-world tasks is lacking. The purpose of this...
Tim Halverson, Anthony J. Hornof
NANONET
2009
Springer
138views Chemistry» more  NANONET 2009»
14 years 1 months ago
Highly Sensitive Arrays of Nano-sized Single-Photon Avalanche Diodes for Industrial and Bio Imaging
In this paper we present a review of recent advances in the field of ultra-sensitive imagers with ultra fast detection capability. Photon counting capability in these sensors is ge...
Edoardo Charbon
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 1 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
CIKM
2006
Springer
14 years 24 days ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...