Sciweavers

4926 search results - page 332 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
128
Voted
JSC
2007
71views more  JSC 2007»
15 years 4 months ago
Rational invariants of a group action. Construction and rewriting
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...
Evelyne Hubert, Irina A. Kogan
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
15 years 3 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
16 years 5 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
SOFTVIS
2003
ACM
15 years 10 months ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...