Sciweavers

686 search results - page 109 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
148
Voted
UAI
1997
15 years 4 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
143
Voted
ACMACE
2009
ACM
15 years 1 months ago
Facial caricature generation using a quadratic deformation model
In this paper we propose a novel approach for generating expressive caricatures from an input image. The novelty of this work comes from combining an Active Appearance Model facia...
Mohammad Obaid, D. Lond, Ramakrishnan Mukundan, Ma...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 3 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
154
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
140
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 4 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...