Sciweavers

184 search results - page 27 / 37
» Packing Cliques in Graphs with Independence Number 2
Sort
View
ARITH
2005
IEEE
14 years 1 months ago
A Linear-System Operator Based Scheme for Evaluation of Multinomials
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
Pavan Adharapurapu, Milos D. Ercegovac
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
ALGOSENSORS
2009
Springer
13 years 5 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...