4865 search results - page 744 / 973 » The Complexity of Graph Connectivity |
132
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
131
click to vote
NIPS
2003
15 years 5 months ago
2003
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
104
click to vote
AAAI
1998
15 years 5 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
118
click to vote
COLING
2000
15 years 5 months ago
2000
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
113
click to vote
NIPS
2000
15 years 5 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...