Sciweavers

9841 search results - page 619 / 1969
» Distributed Value Functions
Sort
View
COLT
1999
Springer
15 years 11 months ago
On PAC Learning Using Winnow, Perceptron, and a Perceptron-like Algorithm
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
Rocco A. Servedio
GRAPHICSINTERFACE
2000
15 years 8 months ago
Approximation of Glossy Reflection with Prefiltered Environment Maps
A method is presented that can render glossy reflections with arbitrary isotropic bidirectional reflectance distribution functions (BRDFs) at interactive rates using texture mappi...
Jan Kautz, Michael D. McCool
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 4 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
16 years 8 months ago
Validating Multi-column Schema Matchings by Type
Validation of multi-column schema matchings is essential for successful database integration. This task is especially difficult when the databases to be integrated contain little o...
Bing Tian Dai, Nick Koudas, Divesh Srivastava, Ant...
ICCCN
2007
IEEE
16 years 1 months ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu