Sciweavers

4894 search results - page 112 / 979
» Choices
Sort
View
IJCV
2007
144views more  IJCV 2007»
15 years 6 months ago
Generalized Gradients: Priors on Minimization Flows
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows. Classically, the definition of a gradient depends d...
Guillaume Charpiat, Pierre Maurel, Jean-Philippe P...
124
Voted
ANOR
2005
93views more  ANOR 2005»
15 years 6 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin
AI
2004
Springer
15 years 6 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
LRE
2007
62views more  LRE 2007»
15 years 6 months ago
Corpus-based generation of head and eyebrow motion for an embodied conversational agent
Humans are known to use a wide range of non-verbal behaviour while speaking. Generating naturalistic embodied speech for an artificial agent is therefore an application where tech...
Mary Ellen Foster, Jon Oberlander
IJCV
2000
93views more  IJCV 2000»
15 years 6 months ago
How Optimal Depth Cue Integration Depends on the Task
Bayesian parameter estimation can be used to generate statistically optimal solutions to the problem of cue integration. However, the complexity and dimensionality of these solutio...
Paul R. Schrater, Daniel Kersten