683 search results - page 44 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
WEA
2010
Springer
14 years 29 days ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
AAAI
2006
13 years 9 months ago
2006
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...