554 search results - page 37 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
APPROX
2006
Springer
14 years 15 days ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
ICMLA
2009
13 years 6 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
DATE
2006
IEEE
14 years 13 days ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...