Sciweavers

5210 search results - page 45 / 1042
» Exact geometric computation
Sort
View
CCCG
2010
13 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
CF
2008
ACM
13 years 12 months ago
Exact multi-pattern string matching on the cell/b.e. processor
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
ICPR
2008
IEEE
14 years 4 months ago
Exact integral images at generic angles for 2D barcode detection
Using integral images for fast computation of sums of rectangular areas is very popular in computer vision. However the method does not extend naturally to rotations at arbitrary ...
Tat-Jun Chin, Hanlin Goh, Ngan-Meng Tan
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 11 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 8 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala