Sciweavers

2957 search results - page 210 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
IPL
2010
115views more  IPL 2010»
15 years 5 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
ICC
2007
IEEE
245views Communications» more  ICC 2007»
16 years 24 days ago
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
Feng Liu, Ling-ge Jiang, Chen He
CGF
2010
182views more  CGF 2010»
15 years 4 months ago
A Data-driven Segmentation for the Shoulder Complex
The human shoulder complex is perhaps the most complicated joint in the human body being comprised of a set of three bones, muscles, tendons, and ligaments. Despite this anatomica...
Q. Youn Hong, Sang Il Park, Jessica K. Hodgins
MOBIHOC
2009
ACM
16 years 1 months ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu
ATAL
2009
Springer
16 years 1 months ago
Combinatorial prediction markets for event hierarchies
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Mingyu Guo, David M. Pennock