966 search results - page 137 / 194 » A Two-Level Learning Method for Generalized Multi-instance P... |
120
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
115
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Name ambiguity problem has been a challenging issue for a long history. In this paper, we intend to make a thorough investigation of the whole problem. Specifically, we formalize ...
139
click to vote
ML
2002
ACM
15 years 2 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
129
Voted
IFM
2009
Springer
15 years 9 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
115
Voted
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
Adoption of advanced automated SE (ASE) tools would be favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software pred...