Sciweavers

1632 search results - page 86 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
171
Voted
TEC
2002
183views more  TEC 2002»
15 years 3 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
16 years 22 days ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
122
Voted
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
15 years 7 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz
139
Voted
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
156
Voted
CVPR
2009
IEEE
16 years 10 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa