Sciweavers

2597 search results - page 218 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
14 years 11 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
ANOR
2011
101views more  ANOR 2011»
14 years 8 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao
ECCV
2008
Springer
16 years 3 months ago
View Point Tracking of Rigid Objects Based on Shape Sub-manifolds
We study the task to infer and to track the viewpoint onto a 3D rigid object by observing its image contours in a sequence of images. To this end, we consider the manifold of invar...
Christian Gosch, Ketut Fundana, Anders Heyden, Chr...
ICML
2005
IEEE
16 years 2 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
EPIA
2009
Springer
15 years 8 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...