373 search results - page 16 / 75 » Counting in Trees for Free |
134
Voted
SISAP
2008
IEEE
15 years 12 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
184
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
143
click to vote
FAW
2008
Springer
15 years 7 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
145
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
143
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...