Sciweavers

309 search results - page 58 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 5 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
COMPGEOM
2003
ACM
14 years 27 days ago
Billboard clouds
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...
Xavier Décoret, Frédo Durand, Fran&c...
PG
2000
IEEE
14 years 18 hour ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
SIGGRAPH
1996
ACM
13 years 11 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe