Sciweavers

19700 search results - page 3586 / 3940
» DNA-Based Computation Times
Sort
View
CGI
2006
IEEE
15 years 10 months ago
Highly Stylised Drawn Animation
Abstract. In this paper we argue for our NPAR system as an effective 2D alternative to most of NPR research which is focused on frame coherent stylised rendering of 3D models. Our ...
Fabian Di Fiore, Frank Van Reeth, John Patterson, ...
CIKM
2006
Springer
15 years 10 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
FOCS
2004
IEEE
15 years 10 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
15 years 10 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...
DCOSS
2006
Springer
15 years 10 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
« Prev « First page 3586 / 3940 Last » Next »