Sciweavers

2310 search results - page 240 / 462
» The selection efficiency of tournaments
Sort
View
UAI
2008
14 years 5 days ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
MCU
2004
59views Hardware» more  MCU 2004»
14 years 4 days ago
On the Complexity of Universal Programs
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
Alain Colmerauer
DMDW
2000
161views Management» more  DMDW 2000»
14 years 3 days ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
AAAI
1994
14 years 2 days ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
IJCAI
1993
14 years 2 days ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...