Sciweavers

1024 search results - page 77 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
TCOM
2010
106views more  TCOM 2010»
14 years 8 months ago
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs
—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i....
Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar...
ICPR
2010
IEEE
14 years 7 months ago
Data Classification on Multiple Manifolds
Unlike most previous manifold-based data classification algorithms assume that all the data points are on a single manifold, we expect that data from different classes may reside ...
Rui Xiao, Qijun Zhao, David Zhang, Pengfei Shi
DAC
2010
ACM
15 years 1 months ago
A parallel integer programming approach to global routing
We propose a parallel global routing algorithm that concurrently processes routing subproblems corresponding to rectangular subregions covering the chip area. The algorithm uses a...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
14 years 11 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
ICCV
2005
IEEE
15 years 11 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler