Sciweavers

868 search results - page 15 / 174
» A general compression algorithm that supports fast searching
Sort
View
CHI
2006
ACM
14 years 8 months ago
Time is of the essence: an evaluation of temporal compression algorithms
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
Simon Tucker, Steve Whittaker
WWW
2007
ACM
14 years 8 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...
GECCO
2010
Springer
181views Optimization» more  GECCO 2010»
14 years 13 days ago
Evolving neural networks in compressed weight space
We propose a new indirect encoding scheme for neural networks in which the weight matrices are represented in the frequency domain by sets of Fourier coefficients. This scheme exp...
Jan Koutnik, Faustino J. Gomez, Jürgen Schmid...
KDD
2009
ACM
183views Data Mining» more  KDD 2009»
14 years 8 months ago
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more ...
Bin Zhou 0002, Daxin Jiang, Jian Pei, Hang Li
SIGCOMM
2005
ACM
14 years 1 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...