458 search results - page 61 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
107
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
133
Voted
NIPS
2001
15 years 4 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
137
click to vote
TIP
2010
14 years 10 months ago
2010
We propose algorithms for tracking the boundary contour of a deforming object from an image sequence, when the nonaffine (local) deformation over consecutive frames is large and th...
144
Voted
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
129
Voted
FC
2009
Springer
15 years 10 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...