Sciweavers

62 search results - page 3 / 13
» Effective bounds for P-recursive sequences
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 1 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
AAAI
2000
14 years 10 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
Sakib A. Mondal, Anup K. Sen
CVPR
2004
IEEE
15 years 11 months ago
Efficient Tracking with the Bounded Hough Transform
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...
Michael A. Greenspan, Limin Shang, Piotr Jasiobedz...
NIPS
2004
14 years 10 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
VLDB
2002
ACM
184views Database» more  VLDB 2002»
15 years 9 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving