Sciweavers

906 search results - page 115 / 182
» Matching Subsequences in Trees
Sort
View
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
14 years 3 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
CNSR
2005
IEEE
14 years 2 months ago
Shortest-Hop Based Reliable Network Multicast
Although many multicast communication protocols have been recommended at IETF, reliable multicast communications currently rely on programs built at the application layer, e.g., m...
Ka Lun Eddie Law, Daniel Siu
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 2 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
CVPR
2010
IEEE
14 years 1 months ago
Efficient Hierarchical Graph-Based Video Segmentation
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
Matthias Grundmann, Vivek Kwatra, Mei Han, Irfan E...
CP
2000
Springer
14 years 1 months ago
Practical Investigation of Constraints with Graph Views
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
Tobias Müller