Sciweavers

11565 search results - page 85 / 2313
» Computing Minimal Mappings
Sort
View
127
Voted
JEI
2007
144views more  JEI 2007»
15 years 3 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
127
Voted
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 10 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
154
Voted
ISVC
2009
Springer
15 years 8 months ago
Codebook-Based Background Subtraction to Generate Photorealistic Avatars in a Walkthrough Simulator
Foregrounds extracted from the background, which are intended to be used as photorealistic avatars for simulators in a variety of virtual worlds, should satisfy the following four ...
Anjin Park, Keechul Jung, Takeshi Kurata
126
Voted
ICMI
2004
Springer
121views Biometrics» more  ICMI 2004»
15 years 9 months ago
'SlidingMap': introducing and evaluating a new modality for map interaction
In this paper, we describe the concept of a new modality for interaction with digital maps. We propose using inclination as a means for panning maps on a mobile computing device, ...
Matthias Merdes, Jochen Häußler, Matthi...
124
Voted
CGA
2006
15 years 3 months ago
MapShaper.org: A Map Generalization Web Service
: Despite recent advances in map-generalization tools and theories, this work has been slow to find its way into the hands of the map-making public. Mapshaper.org is a free-touse g...
Mark Harrower, Matt Bloch