2924 search results - page 176 / 585 » Lower Bounds in Distributed Computing |
115
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
106
click to vote
NAACL
2004
15 years 2 months ago
2004
Maximum entropy models are a common modeling technique, but prone to overfitting. We show that using an exponential distribution as a prior leads to bounded absolute discounting b...
101
click to vote
CJ
2010
15 years 1 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
102
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
111
click to vote
WIOPT
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...