Sciweavers

87 search results - page 3 / 18
» When is it better not to look ahead
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 24 days 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...
CSCW
2006
ACM
13 years 11 months ago
Don't look stupid: avoiding pitfalls when recommending research papers
If recommenders are to help people be more productive, they need to support a wide variety of real-world information seeking tasks, such as those found when seeking research paper...
Sean M. McNee, Nishikant Kapoor, Joseph A. Konstan
ICTAI
2003
IEEE
13 years 11 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
ICASSP
2011
IEEE
12 years 9 months ago
Clustering of bootstrapped acoustic model with full covariance
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
Xin Chen, Xiaodong Cui, Jian Xue, Peder Olsen, Joh...
INFOCOM
2005
IEEE
13 years 11 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi