Sciweavers

2001 search results - page 152 / 401
» Indexing in a Hypertext Database
Sort
View
WWW
2004
ACM
14 years 11 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
ITS
2000
Springer
112views Multimedia» more  ITS 2000»
14 years 1 months ago
Model of an Adaptive Support Interface for Distance Learning
We developed a distributed support model in an interface for distant learning. The support is integrated into the ExploraGraph navigator which makes it possible to navigate through...
Aude Dufresne
GIS
2008
ACM
14 years 11 months ago
Indexing planar point quartets via geometric attributes
An index is devised to support position-independent search for images containing quartets of icons. Point quartets exist that do not unambiguously map to quadrilaterals, however, ...
Charles Ben Cranston, Hanan Samet
SAC
2005
ACM
14 years 3 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
14 years 3 months ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho