Sciweavers

417 search results - page 28 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
72
Voted
SIGIR
2009
ACM
15 years 4 months ago
Predicting user interests from contextual information
Search and recommendation systems must include contextual information to effectively model users’ interests. In this paper, we present a systematic study of the effectiveness of...
Ryen W. White, Peter Bailey, Liwei Chen
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
15 years 10 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
KDD
2010
ACM
259views Data Mining» more  KDD 2010»
15 years 1 months ago
A probabilistic model for personalized tag prediction
Social tagging systems have become increasingly popular for sharing and organizing web resources. Tag recommendation is a common feature of social tagging systems. Social tagging ...
Dawei Yin, Zhenzhen Xue, Liangjie Hong, Brian D. D...
RTAS
2008
IEEE
15 years 4 months ago
Hybrid Timing Analysis of Modern Processor Pipelines via Hardware/Software Interactions
Embedded systems are often subject to constraints that require determinism to ensure that task deadlines are met. Such systems are referred to as real-time systems. Schedulability...
Sibin Mohan, Frank Mueller