Sciweavers

4110 search results - page 451 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ICIP
2003
IEEE
16 years 8 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
DCC
2004
IEEE
16 years 6 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
IPPS
2006
IEEE
16 years 24 days ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
16 years 11 days ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
CINQ
2004
Springer
125views Database» more  CINQ 2004»
16 years 5 days ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo