3946 search results - page 376 / 790 » The computational complexity of choice sets |
225
click to vote
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
229
click to vote
AAMAS
2012
Springer
14 years 3 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
196
Voted
ICML
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper introduces multiple instance regression, a variant of multiple regression in which each data point may be described by more than one vector of values for the independen...
191
Voted
WABI
2004
Springer
16 years 27 days ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
174
Voted
CP
2008
Springer
15 years 9 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...