Sciweavers

431 search results - page 43 / 87
» KPYR: An Efficient Indexing Method
Sort
View
IJAC
2008
97views more  IJAC 2008»
13 years 9 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
SCANGIS
2003
13 years 11 months ago
Searching Information from Screen Maps
Geographical information and digital maps are integrated in many ways into our every-day life through various GIS solutions. Screen maps and map interfaces should be easyto-use for...
Outi Hermans, Jari Laarni
CIKM
2005
Springer
14 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 9 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...