129
click to vote
STOC
16 years 1 months ago
2004 ACM 
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
122
click to vote
STOC
16 years 1 months ago
2004 ACM 
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
118
Voted
STOC
16 years 1 months ago
2004 ACM 
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
118
click to vote
STOC
16 years 1 months ago
2004 ACM
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
117
click to vote
STOC
16 years 1 months ago
2004 ACM 
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
|
Algorithms