Sciweavers

6105 search results - page 1035 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
BMCBI
2011
15 years 28 days ago
Ultra-fast sequence clustering from similarity networks with SiLiX
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
Vincent Miele, Simon Penel, Laurent Duret
ICASSP
2011
IEEE
14 years 10 months ago
Artificial bandwidth extension of spectral envelope with temporal clustering
We present a new wideband spectral envelope estimation framework for the artificial bandwidth extension problem. The proposed framework builds temporal clusters of the joint sub-...
Can Yagli, Engin Erzin
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 8 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
166
Voted
ECCV
1998
Springer
16 years 8 months ago
Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint
Abstract. The aim of this paper is to explore intrinsic geometric methods of recovering the three dimensional motion of a moving camera from a sequence of images. Generic similarit...
Yi Ma, Jana Kosecka, Shankar Sastry
184
Voted
HPCA
2006
IEEE
16 years 6 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
« Prev « First page 1035 / 1221 Last » Next »