Sciweavers

550 search results - page 48 / 110
» Optimization and Approximation Problems Related to Polynomia...
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 3 months ago
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehl&...
FOCS
2007
IEEE
14 years 3 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 3 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang
ICCAD
2008
IEEE
122views Hardware» more  ICCAD 2008»
14 years 5 months ago
Network flow-based power optimization under timing constraints in MSV-driven floorplanning
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...
Qiang Ma, Evangeline F. Y. Young
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 3 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier