Sciweavers

269 search results - page 38 / 54
» Indexing text data under space constraints
Sort
View
CAD
2004
Springer
13 years 9 months ago
A shape design system using volumetric implicit PDEs
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
Haixia Du, Hong Qin
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 11 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
ICMLA
2010
13 years 7 months ago
Smoothing Gene Expression Using Biological Networks
Gene expression (microarray) data have been used widely in bioinformatics. The expression data of a large number of genes from small numbers of subjects are used to identify inform...
Yue Fan, Mark A. Kon, Shinuk Kim, Charles DeLisi
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 10 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
12 years 8 days ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng