Sciweavers

4372 search results - page 247 / 875
» Algorithmic Theories of Everything
Sort
View
ICIP
2005
IEEE
16 years 7 months ago
Largest-eigenvalue-theory for incremental principal component analysis
In this paper, we present a novel algorithm for incremental principal component analysis. Based on the LargestEigenvalue-Theory, i.e. the eigenvector associated with the largest ei...
Shuicheng Yan, Xiaoou Tang
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
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 6 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 6 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 6 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar