Sciweavers

5606 search results - page 672 / 1122
» Randomization Techniques for Graphs.
Sort
View
STOC
2001
ACM
132views Algorithms» more  STOC 2001»
16 years 7 months ago
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
Ravi Montenegro, Jung-Bae Son
ICPR
2010
IEEE
16 years 1 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
ISBRA
2009
Springer
16 years 1 months ago
Querying Protein-Protein Interaction Networks
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
Guillaume Blin, Florian Sikora, Stéphane Vi...
ICPR
2008
IEEE
16 years 1 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
KBSE
2007
IEEE
16 years 1 months ago
Tool support for the compile-time execution structure of object-oriented programs with ownership annotations
Ownership domain annotations enable obtaining at compiletime the system’s execution structure from the annotated program. The execution structure is sound, hierarchical (and thu...
Marwan Abi-Antoun, Jonathan Aldrich