Sciweavers

11016 search results - page 2162 / 2204
» Digital Information Retrieval
Sort
View
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 10 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu
CHI
2007
ACM
14 years 10 months ago
Hard lessons: effort-inducing interfaces benefit spatial learning
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
Andy Cockburn, Per Ola Kristensson, Jason Alexande...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICALP
2009
Springer
14 years 10 months ago
Secure Function Collection with Sublinear Storage
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong...
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
14 years 10 months ago
Cooperative XPath caching
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
Kostas Lillis, Evaggelia Pitoura
« Prev « First page 2162 / 2204 Last » Next »