268 search results - page 34 / 54 » Cleaning Interval Graphs |
112
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
102
click to vote
PVLDB
2010
14 years 8 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
ESA
2007
Springer
15 years 2 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...