994 search results - page 70 / 199 » Custom Computing Machines for the Set Covering Problem |
141
click to vote
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
114
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
106
Voted
ACL
2009
14 years 10 months ago
2009
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
102
Voted
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
107
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...