Sciweavers

765 search results - page 3 / 153
» Empirical Design of Geometric Algorithms
Sort
View
AAAI
2010
13 years 6 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...
ICASSP
2010
IEEE
13 years 5 months ago
Empirical Type-i filter design for image interpolation
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...
Karl S. Ni, Truong Q. Nguyen
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 6 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...
ICCAD
2003
IEEE
114views Hardware» more  ICCAD 2003»
14 years 2 months ago
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
Peter G. Sassone, Sung Kyu Lim
COMPGEOM
1999
ACM
13 years 9 months ago
Geometric Pattern Matching: A Performance Study
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Sure...