Sciweavers

8 search results - page 2 / 2
» Hardness of Minimizing and Learning DNF Expressions
Sort
View
NIPS
2007
13 years 9 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 7 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 12 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier