Sciweavers

331 search results - page 28 / 67
» The Plaited Structure of Time in Information Technology
Sort
View
JCDL
2005
ACM
84views Education» more  JCDL 2005»
14 years 4 months ago
Finding a catalog: generating analytical catalog records from well-structured digital texts
One of the criticisms library users often make of catalogs is that they rarely include information below the bibliographic level. It is generally impossible to search a catalog fo...
David M. Mimno, Alison Jones, Gregory Crane
ICADL
2003
Springer
140views Education» more  ICADL 2003»
14 years 4 months ago
LVS Digital Library Cluster with Fair Memory Utilization
A digital library system consists of LVS(Linux Virtual Server) operating with software clustering technology provides is designed on Linux environment. In the cluster of servers fa...
MinHwan Ok, Kyeongmo Kang, Myong-Soon Park
SIGIR
2006
ACM
14 years 4 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
WWW
2006
ACM
14 years 11 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
SPIRE
2005
Springer
14 years 4 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel