Sciweavers

53 search results - page 7 / 11
» Regularity Lemmas and Combinatorial Algorithms
Sort
View
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ECCC
2006
116views more  ECCC 2006»
13 years 7 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
FUN
2007
Springer
98views Algorithms» more  FUN 2007»
14 years 1 months ago
Die Another Day
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
Rudolf Fleischer
FINTAL
2006
13 years 11 months ago
Morphological Lexicon Extraction from Raw Text Data
The tool extract enables the automatic extraction of lemma-paradigm pairs from raw text data. The tool uses search patterns that consist of regular expressions and propositional lo...
Markus Forsberg, Harald Hammarström, Aarne Ra...