Sciweavers

346 search results - page 44 / 70
» Isodiametric Problems for Polygons
Sort
View
CCCG
2010
13 years 11 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...
ICPR
2002
IEEE
14 years 11 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
APNOMS
2009
Springer
14 years 4 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
MMM
2003
Springer
258views Multimedia» more  MMM 2003»
14 years 3 months ago
2D Shape Transformation Using 3D Blending
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiya...
DAWAK
2000
Springer
14 years 2 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton