Sciweavers

1405 search results - page 145 / 281
» Popularity at Minimum Cost
Sort
View
150
Voted
ECOOP
2012
Springer
13 years 7 months ago
Application-Only Call Graph Construction
Abstract. Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given pr...
Karim Ali, Ondrej Lhoták
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 5 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
153
Voted
TCS
2010
15 years 2 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
WWW
2008
ACM
16 years 5 months ago
Finding the right facts in the crowd: factoid question answering over social media
Community Question Answering has emerged as a popular and effective paradigm for a wide range of information needs. For example, to find out an obscure piece of trivia, it is now ...
Jiang Bian, Yandong Liu, Eugene Agichtein, Hongyua...
TPDS
2008
92views more  TPDS 2008»
15 years 4 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu