Sciweavers

4781 search results - page 435 / 957
» Complexity at large
Sort
View
GIS
2006
ACM
16 years 7 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
176
Voted
MICCAI
2003
Springer
16 years 7 months ago
Correspondence Detection Using Wavelet-Based Attribute Vectors
Finding point correspondence in anatomical images is a key step in shape analysis and deformable registration. This paper proposes an automatic correspondence detection algorithm u...
Zhong Xue, Dinggang Shen, Christos Davatzikos
ICML
2008
IEEE
16 years 7 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICML
2006
IEEE
16 years 7 months ago
Statistical debugging: simultaneous identification of multiple bugs
We describe a statistical approach to software debugging in the presence of multiple bugs. Due to sparse sampling issues and complex interaction between program predicates, many g...
Alice X. Zheng, Michael I. Jordan, Ben Liblit, May...
ICML
2005
IEEE
16 years 7 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli