Sciweavers

765 search results - page 83 / 153
» Empirical Design of Geometric Algorithms
Sort
View
SIGGRAPH
2000
ACM
15 years 4 months ago
Escherization
This paper introduces and presents a solution to the “Escherization” problem: given a closed figure in the plane, find a new closed figure that is similar to the original a...
Craig S. Kaplan, David Salesin
DOCENG
2007
ACM
15 years 3 months ago
Preserving the aesthetics during non-fixed aspect ratio scaling of the digital border
To enhance the visual effect of a photo, various digital borders or frames are provided for photo decoration at photo sharing websites. Even though multiple versions of the same b...
Hui Chao, Prasad Gabbur, Anthony Wiley
MOBICOM
2006
ACM
15 years 5 months ago
Boundary recognition in sensor networks by topological methods
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
Yue Wang, Jie Gao, Joseph S. B. Mitchell
ICML
2005
IEEE
16 years 20 days ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
JCST
2008
144views more  JCST 2008»
14 years 11 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...