Sciweavers

2412 search results - page 321 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
Better redistribution with inefficient allocation in multi-unit auctions with unit demand
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...
Mingyu Guo, Vincent Conitzer
BC
1998
111views more  BC 1998»
13 years 10 months ago
How to "hear" visual disparities: real-time stereoscopic spatial depth analysis using temporal resonance
Abstract. In a stereoscopic system, both eyes or cameras have a slightly di€erent view. As a consequence, small variations between the projected images exist (`disparities') ...
Bernd Porr, Alex Cozzi, Florentin Wörgöt...
TPDS
2010
109views more  TPDS 2010»
13 years 8 months ago
Thermal-Aware Task Scheduling for 3D Multicore Processors
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...
Xiuyi Zhou, Jun Yang 0002, Yi Xu, Youtao Zhang, Ji...
CCR
2011
13 years 5 months ago
The politecast communication primitive for low-power wireless
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
Marcus Lundén, Adam Dunkels
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
14 years 11 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
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...
Charu C. Aggarwal