567 search results - page 29 / 114 » Exact train pathing |
KDD
1995
ACM
15 years 3 months ago
1995
ACM
Random errors and insufficiencies in databases limit the performance of any classifier trained from and applied to the database. In this paper we propose a method to estimate the ...
110
click to vote
SENSYS
2003
ACM
15 years 5 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
112
click to vote
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
107
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
108
click to vote
IMC
2010
ACM
14 years 9 months ago
2010
ACM
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...