Sciweavers

610 search results - page 99 / 122
» An Efficient Method for Compressed Sensing
Sort
View
ASE
2002
137views more  ASE 2002»
15 years 17 days ago
The DSD Schema Language
XML (Extensible Markup Language), a linear syntax for trees, has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application o...
Nils Klarlund, Anders Møller, Michael I. Sc...
TC
1998
15 years 10 days ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
ICTAI
2009
IEEE
14 years 10 months ago
Merging Qualitative Constraint Networks in a Piecewise Fashion
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
Jean-François Condotta, Souhila Kaci, Pierr...
100
Voted
ICIP
2001
IEEE
16 years 2 months ago
Orthogonal quincunx wavelets with fractional orders
We present a new family of 2D orthogonal wavelets which uses quincunx sampling. The orthogonal refinement filters have a simple analytical expression in the Fourier domain as a fu...
Manuela Feilner, Mathews Jacob, Michael Unser
87
Voted
CAD
2006
Springer
15 years 22 days ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang