Sciweavers

10457 search results - page 268 / 2092
» Data Mapping as Search
Sort
View
VL
2006
IEEE
16 years 19 days ago
Sketching with Conceptual Metaphors to Explain Computational Processes
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
David G. Hendry
PODS
2007
ACM
142views Database» more  PODS 2007»
16 years 6 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
16 years 1 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
JCDL
2003
ACM
119views Education» more  JCDL 2003»
15 years 12 months ago
Genescene: Biomedical Text And Data Mining
To access the content of digital texts efficiently, it is necessary to provide more sophisticated access than keyword based searching. Genescene provides biomedical researchers wi...
Gondy Leroy, Hsinchun Chen, Jesse D. Martinez, Sha...
PVLDB
2008
232views more  PVLDB 2008»
15 years 5 months ago
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan