20441 search results - page 3643 / 4089 » Locally Computable Structures |
146
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
138
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...
115
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
116
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We develop a generic method for the review matching problem, which is to match unstructured text reviews to a list of objects, where each object has a set of attributes. To this e...
134
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...