Sciweavers

828 search results - page 129 / 166
» Cost Estimation for Web Applications
Sort
View
110
Voted
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 8 days ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
GLOBECOM
2009
IEEE
15 years 6 months ago
Model-Based Opportunistic Channel Access in Dynamic Spectrum Access Networks
Abstract—We propose a model-based channel access mechanism for cognitive radio-enabled secondary network, which opportunistically uses the channel of an unslotted primary network...
Manuj Sharma, Anirudha Sahoo, K. D. Nayak
100
Voted
IAT
2005
IEEE
15 years 5 months ago
Exploiting Multi-Agent Interactions for Identifying the Best-Payoff Information Source
In many different applications on the Web, distributed agents would like to discover and access high quality information sources. This is a challenging problem since an agent does...
Young-Woo Seo, Katia P. Sycara
CIKM
2008
Springer
15 years 1 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
CSCW
2012
ACM
13 years 7 months ago
Predicting tie strength in a new medium
We have friends we consider very close and acquaintances we barely know. The social sciences use the term tie strength to denote this differential closeness with the people in our...
Eric Gilbert