2412 search results - page 321 / 483 » Which Problems Have Strongly Exponential Complexity |
134
Voted
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
117
Voted
BC
1998
15 years 2 months ago
1998
Abstract. In a stereoscopic system, both eyes or cameras have a slightly dierent view. As a consequence, small variations between the projected images exist (`disparities') ...
131
Voted
TPDS
2010
15 years 28 days ago
2010
Abstract—A rising horizon in chip fabrication is the 3D integration technology. It stacks two or more dies vertically with a dense, highspeed interface to increase the device den...
170
click to vote
CCR
2011
14 years 9 months ago
2011
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
225
Voted
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...