Sciweavers

7129 search results - page 240 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 10 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
CVPR
2005
IEEE
16 years 6 months ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 11 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 9 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...