2531 search results - page 446 / 507 » Group testing in graphs |
184
click to vote
SIAMJO
2002
15 years 5 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
150
click to vote
ECCC
2008
15 years 5 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
184
click to vote
ASPDAC
2010
ACM
15 years 3 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
137
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
164
click to vote
CICLING
2011
Springer
14 years 9 months ago
2011
Springer
In recent years, extraction of temporal relations for events that express sentiments has drawn great attention of the Natural Language Processing (NLP) research communities. In thi...