Sciweavers

740 search results - page 96 / 148
» An approximation ratio for biclustering
Sort
View
VLSID
1993
IEEE
133views VLSI» more  VLSID 1993»
15 years 4 months ago
An Area-Efficient Systolic Architecture for Real-Time VLSI Finite Impulse Response Filters
An area-eficzent systolic architecture for realtime, programmable-coeBcient jinite impulse response (FIR)filters is presented. A technique called pipelined clustering is introduce...
V. Visvanathan, Nibedita Mohanty, S. Ramanathan
CISS
2007
IEEE
15 years 3 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 3 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
ICIP
1995
IEEE
15 years 3 months ago
Fast image search using a multiscale stochastic model
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...
S. Sista, Charles A. Bouman, Jan P. Allebach
AAIM
2005
Springer
81views Algorithms» more  AAIM 2005»
15 years 1 months ago
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
Xiao-Dong Hu, Tianping Shuai