Sciweavers

500 search results - page 55 / 100
» Asynchronous Search with Aggregations
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 3 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
PAMI
2008
152views more  PAMI 2008»
13 years 8 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
CHI
2009
ACM
14 years 8 months ago
Information foraging in E-voting
In this paper, we present a case study of humaninformation interaction in the online realm of politics. The case study consists of a participant observed while searching and brows...
Ravi K. Vatrapu, Scott P. Robertson
CHI
2004
ACM
14 years 8 months ago
Tangible interface for collaborative information retrieval
Most information retrieval (IR) interfaces are designed for a single user working with a dedicated interface. We present a system in which the IR interface has been fully integrat...
Alan F. Blackwell, Mark Stringer, Eleanor F. Toye,...
AUSAI
2003
Springer
14 years 1 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar