Sciweavers

868 search results - page 51 / 174
» A general compression algorithm that supports fast searching
Sort
View
JCDL
2006
ACM
143views Education» more  JCDL 2006»
14 years 1 months ago
Categorizing web search results into meaningful and stable categories using fast-feature techniques
When search results against digital libraries and web resources have limited metadata, augmenting them with meaningful and stable category information can enable better overviews ...
Bill Kules, Jack Kustanowitz, Ben Shneiderman
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 8 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 16 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
WWW
2003
ACM
14 years 8 months ago
A Context-Based Information Agent for Supporting Intelligent Distance Learning Environments
The large amount of information now available on the Web can play a prominent role in building a cooperative intelligent distance learning environment. We propose a system to prov...
Mohammed Abdel Razek, Claude Frasson, Marc Kaltenb...
GIS
2008
ACM
14 years 8 months ago
Fast and extensible building modeling from airborne LiDAR data
This paper presents an automatic algorithm which reconstructs building models from airborne LiDAR (light detection and ranging) data of urban areas. While our algorithm inherits t...
Qian-Yi Zhou, Ulrich Neumann