Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICASSP
2011
IEEE
10 years 2 months ago
Look ahead orthogonal matching pursuit
For compressive sensing, we endeavor to improve the recovery performance of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlyin...
Saikat Chatterjee, Dennis Sundman, Mikael Skoglund
JCIT
2010
150views more  JCIT 2010»
10 years 5 months ago
Characteristic Description of Coupled Task Sets Based on Design Structure Matrix and Its Optimal Time and Efforts Solution by Ge
The complicated interactions among tasks lead to iterations in product design and development. To maintain the market share, enterprises should effectively manage their product de...
Ting-gui Chen, Chun-hua Ju
JMLR
2011
110views more  JMLR 2011»
10 years 5 months ago
Training SVMs Without Offset
We develop, analyze, and test a training algorithm for support vector machine classifiers without offset. Key features of this algorithm are a new, statistically motivated stoppi...
Ingo Steinwart, Don R. Hush, Clint Scovel
ICCV
2009
IEEE
10 years 8 months ago
BLOGS: Balanced local and global search for non-degenerate two view epipolar geometry
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
Aveek S. Brahmachari, Sudeep Sarkar
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
10 years 8 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
TSP
2008
179views more  TSP 2008»
10 years 10 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
TIT
2008
129views more  TIT 2008»
10 years 10 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
JPDC
2006
146views more  JPDC 2006»
10 years 10 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
CORR
2008
Springer
91views Education» more  CORR 2008»
10 years 10 months ago
Exchange of Limits: Why Iterative Decoding Works
We consider communication over a family of binary-input memoryless output-symmetric channels using lowdensity parity-check codes under message passing decoding. The asymptotic (in ...
Satish Babu Korada, Rüdiger L. Urbanke
IRREGULAR
1995
Springer
11 years 1 months ago
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mar...
books