Sciweavers

7758 search results - page 351 / 1552
» On the Number of Distributive Lattices
Sort
View
CSDA
2007
105views more  CSDA 2007»
15 years 6 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
CAD
2005
Springer
15 years 6 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
CORR
2008
Springer
133views Education» more  CORR 2008»
15 years 6 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
TSMC
2008
128views more  TSMC 2008»
15 years 6 months ago
Adaptive Sensor Placement and Boundary Estimation for Monitoring Mass Objects
Sensor networks are widely used in monitoring and tracking a large number of objects. Without prior knowledge on the dynamics of object distribution, their density estimation could...
Zhen Guo, MengChu Zhou, Guofei Jiang
OPODIS
2010
15 years 4 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...