Sciweavers

824 search results - page 44 / 165
» Weighted Low-Rank Approximations
Sort
View
FOIKS
2004
Springer
15 years 3 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
CVPR
2006
IEEE
15 years 11 months ago
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik S...
RECOMB
2006
Springer
15 years 10 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
15 years 3 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
14 years 9 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson