Sciweavers

1568 search results - page 232 / 314
» The problem of examination questions in algorithmics
Sort
View
RECOMB
2001
Springer
16 years 4 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
ICASSP
2008
IEEE
15 years 10 months ago
An information theoretic approach to processing management
In region surveillance applications, sensors oftentimes accumulate an overwhelmingly large amount of data, making it infeasible to process all of the collected data in real-time. ...
Christopher M. Kreucher, Kevin M. Carter
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
16 years 5 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
JAIR
2008
148views more  JAIR 2008»
15 years 4 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
CVPR
2000
IEEE
16 years 6 months ago
Integrating Color, Texture, and Geometry for Image Retrieval
This paper examines the problem of image retrieval from large, heterogeneous image databases. We present a technique that fulfills several needs identified by surveying recent res...
Nicholas R. Howe, Daniel P. Huttenlocher