Sciweavers

2107 search results - page 133 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
118
Voted
TPDS
1998
92views more  TPDS 1998»
15 years 3 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
163
Voted
TON
2012
13 years 6 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
132
Voted
CVPR
2007
IEEE
16 years 5 months ago
Resolving Objects at Higher Resolution from a Single Motion-blurred Image
Motion blur can degrade the quality of images and is considered a nuisance for computer vision problems. In this paper, we show that motion blur can in-fact be used for increasing...
Amit K. Agrawal, Ramesh Raskar
137
Voted
EMSOFT
2004
Springer
15 years 9 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 4 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...