13603 search results - page 164 / 2721 » On the Complexity of Computing Treelength |
166
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
157
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
190
click to vote
EGH
2003
Springer
15 years 11 months ago
2003
Springer
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
185
click to vote
FOCS
2006
IEEE
16 years 19 days ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
201
click to vote
Lecture Notes
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...