Sciweavers

1791 search results - page 227 / 359
» Policy-Driven Management of Data Sets
Sort
View
SIGIR
1992
ACM
15 years 10 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
DAWAK
2007
Springer
15 years 10 months ago
An Efficient Algorithm for Identifying the Most Contributory Substring
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
Ben Stephenson
SIGIR
2010
ACM
15 years 10 months ago
Many are better than one: improving multi-document summarization via weighted consensus
Given a collection of documents, various multi-document summarization methods have been proposed to generate a short summary. However, few studies have been reported on aggregatin...
Dingding Wang, Tao Li
CIKM
2008
Springer
15 years 8 months ago
SHOPSMART: product recommendations through technical specifications and user reviews
This paper describes a new method for providing recommendations tailored to a user's preferences using text mining techniques and online technical specifications of products....
Alexander Yates, James Joseph, Ana-Maria Popescu, ...
CNSR
2005
IEEE
100views Communications» more  CNSR 2005»
15 years 8 months ago
Malicious Behaviour in Content-Addressable Peer-to-Peer Networks
Distributed Hash Tables (DHTs) promise to manage huge sets of key-value pairs in a Peer-to-Peer manner. The Content-Addressable Network (CAN) is a prominent variant of DHT. A crit...
Thomas Reidemeister, Klemens Böhm, Paul A. S....