Sciweavers

2638 search results - page 288 / 528
» Extracting Approximate Patterns
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
DAC
2007
ACM
16 years 7 months ago
Parameterized Macromodeling for Analog System-Level Design Exploration
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
Jian Wang, Xin Li, Lawrence T. Pileggi
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 6 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
ICASSP
2009
IEEE
16 years 1 months ago
Q-SIFT: Efficient feature descriptors for distributed camera calibration
We consider camera self-calibration, i.e. the estimation of parameters for camera sensors, in the setting of a visual sensor network where the sensors are distributed and energy-c...
Chao Yu, Gaurav Sharma
ICASSP
2009
IEEE
16 years 1 months ago
Document reconstruction using dynamic programming
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...