Sciweavers

4137 search results - page 542 / 828
» On the number of matchings of a tree
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
16 years 11 days ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
CIKM
2004
Springer
16 years 4 days ago
Exploiting hierarchical relationships in conceptual search
As the number of available Web pages grows, users experience increasing difficulty finding documents relevant to their interests. One of the underlying reasons for this is that mo...
Devanand Ravindran, Susan Gauch
VRML
2003
ACM
16 years 11 min ago
Early experiences with a 3D model search engine
New acquisition and modeling tools make it easier to create 3D models, and affordable and powerful graphics hardware makes it easier to use them. As a result, the number of 3D mo...
Patrick Min, John A. Halderman, Michael M. Kazhdan...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 11 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
SIGIR
1998
ACM
15 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...