2924 search results - page 214 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
142
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper studies automatic segmentation of multiple
motions from tracked feature points through spectral embedding
and clustering of linear subspaces. We show that
the dimensi...
139
Voted
VMCAI
2010
Springer
16 years 19 days ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
116
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
117
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...