Sciweavers

10051 search results - page 208 / 2011
» A Dynamic Separator Algorithm
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
DynamicBoost: Boosting Time Series Generated by Dynamical Systems
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
René Vidal, Paolo Favaro
IJCNN
2006
IEEE
16 years 5 days ago
Extraction of Components with Structured Variance
Abstract— We present a method for exploratory data analysis of large spatiotemporal data sets such as global longtime climate measurements, extending our previous work on semibli...
Alexander Ilin, Harri Valpola, Erkki Oja
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
16 years 1 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
FOCS
1999
IEEE
15 years 10 months ago
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice
Christian Borgs, Jennifer T. Chayes, Alan M. Friez...
IPL
2007
71views more  IPL 2007»
15 years 6 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy