Sciweavers

313 search results - page 60 / 63
» Consistent Approximations and Approximate Functions and Grad...
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 11 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
CGF
2006
191views more  CGF 2006»
13 years 8 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
ATAL
2003
Springer
14 years 2 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig
CVPR
2004
IEEE
14 years 10 months ago
MetaMorphs: Deformable Shape and Texture Models
We present a new class of deformable models, MetaMorphs, whose formulation integrates both shape and interior texture. The model deformations are derived from both boundary and re...
Xiaolei Huang, Dimitris N. Metaxas, Ting Chen
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
14 years 3 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic