Sciweavers

6315 search results - page 1007 / 1263
» Approximating Solution Structure
Sort
View
GLOBECOM
2008
IEEE
15 years 11 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 11 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
FOCS
2006
IEEE
15 years 10 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
15 years 10 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
15 years 10 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...
« Prev « First page 1007 / 1263 Last » Next »