Sciweavers

1048 search results - page 94 / 210
» Best Probabilistic Transformers
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
TOG
2008
103views more  TOG 2008»
15 years 6 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
AROBOTS
1999
104views more  AROBOTS 1999»
15 years 5 months ago
Reinforcement Learning Soccer Teams with Incomplete World Models
We use reinforcement learning (RL) to compute strategies for multiagent soccer teams. RL may pro t signi cantly from world models (WMs) estimating state transition probabilities an...
Marco Wiering, Rafal Salustowicz, Jürgen Schm...
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 5 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
ACL
2010
15 years 4 months ago
Topic Models for Word Sense Disambiguation and Token-Based Idiom Detection
This paper presents a probabilistic model for sense disambiguation which chooses the best sense based on the conditional probability of sense paraphrases given a context. We use a...
Linlin Li, Benjamin Roth, Caroline Sporleder