1272 search results - page 119 / 255 » The Set Cover with Pairs Problem |
128
Voted
SDM
2009
SIAM
16 years 18 days ago
2009
SIAM
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
137
Voted
ACTA
2000
15 years 3 months ago
2000
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...
124
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
119
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
123
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...