Sciweavers

620 search results - page 10 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
COMPGEOM
2005
ACM
15 years 1 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
SIBGRAPI
2007
IEEE
15 years 6 months ago
A Simple Framework for Natural Animation of Digitized Models
We present a versatile, fast and simple framework to generate animations of scanned human characters from input optical motion capture data. Our method is purely meshbased and req...
Edilson de Aguiar, Rhaleb Zayer, Christian Theobal...
CP
2008
Springer
15 years 1 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
GLOBECOM
2006
IEEE
15 years 5 months ago
Topology Control for Simple Mobile Networks
— Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumptio...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
PRL
2006
127views more  PRL 2006»
14 years 11 months ago
Ho-Kashyap classifier with early stopping for regularization
This paper focuses on linear classification using a fast and simple algorithm known as the Ho
Fabien Lauer, Gérard Bloch