5592 search results - page 363 / 1119 » On Random Betweenness Constraints |
132
click to vote
COCO
2007
Springer
16 years 26 days ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
183
click to vote
TCC
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
146
click to vote
SAC
2006
ACM
16 years 19 days ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
174
Voted
ISAAC
2005
Springer
16 years 5 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
182
click to vote
CVPR
2010
IEEE
16 years 9 hour ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...