Sciweavers

4198 search results - page 64 / 840
» In search of lost time
Sort
View
CHI
2011
ACM
14 years 9 months ago
Am I wasting my time organizing email?: a study of email refinding
We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating compl...
Steve Whittaker, Tara Matthews, Julian A. Cerruti,...
JCDL
2010
ACM
259views Education» more  JCDL 2010»
15 years 11 months ago
Exploiting time-based synonyms in searching document archives
Query expansion of named entities can be employed in order to increase the retrieval effectiveness. A peculiarity of named entities compared to other vocabulary terms is that they...
Nattiya Kanhabua, Kjetil Nørvåg
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 7 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
GLOBECOM
2007
IEEE
16 years 5 days ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
IPPS
1997
IEEE
15 years 10 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...