Sciweavers

230 search results - page 30 / 46
» Faster algorithms for the characteristic polynomial
Sort
View
63
Voted
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
14 years 11 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
86
Voted
SIGMOD
2005
ACM
118views Database» more  SIGMOD 2005»
15 years 9 months ago
RPJ: Producing Fast Join Results on Streams through Rate-based Optimization
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...
Yufei Tao, Man Lung Yiu, Dimitris Papadias, Marios...
61
Voted
SIGGRAPH
1998
ACM
15 years 1 months ago
Multiple Viewpoint Rendering
This paper presents an algorithm for rendering a static scene from multiple perspectives. While most current computer graphics algorithms render scenes as they appear from a singl...
Michael Halle
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
14 years 11 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
75
Voted
DCOSS
2009
Springer
15 years 4 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...