Sciweavers

2354 search results - page 198 / 471
» Randomness, Stochasticity and Approximations
Sort
View
CGF
2008
177views more  CGF 2008»
13 years 9 months ago
Expressive Facial Gestures From Motion Capture Data
Human facial gestures often exhibit such natural stochastic variations as how often the eyes blink, how often the eyebrows and the nose twitch, and how the head moves while speaki...
Eunjung Ju, Jehee Lee
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 8 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 10 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ANSS
2008
IEEE
14 years 4 months ago
A Simulation Study of Common Mobility Models for Opportunistic Networks
Understanding mobility characteristics is important for the design and analysis of routing schemes for mobile ad hoc networks (MANETs). This is especially true for mobile opportun...
Muhammad Abdulla, Robert Simon