Sciweavers

259 search results - page 29 / 52
» Graph Distances in the Data-Stream Model
Sort
View
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CAD
2007
Springer
13 years 8 months ago
A spectral approach to shape-based retrieval of articulated 3D models
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
Varun Jain, Hao Zhang 0002
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
14 years 1 months ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint
STACS
2005
Springer
14 years 1 months ago
Connectivity for Wireless Agents Moving on a Cycle or Grid
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
Josep Díaz-Giménez, Xavier Pé...
BPM
2006
Springer
166views Business» more  BPM 2006»
14 years 4 hour ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan