1333 search results - page 125 / 267 » Not a Number of Floating Point Problems |
145
click to vote
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
149
Voted
CIARP
2007
Springer
15 years 5 months ago
2007
Springer
This paper deals with the problem of finding the movement of a mobile robot given two consecutive laser scans. The proposed method extracts a line map from the sequence of points ...
134
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
113
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
115
click to vote
EMNLP
2007
15 years 5 months ago
2007
We present V-measure, an external entropybased cluster evaluation measure. Vmeasure provides an elegant solution to many problems that affect previously defined cluster evaluatio...