526 search results - page 77 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
84
Voted
CGO
2003
IEEE
15 years 1 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...