2252 search results - page 202 / 451 » Lower Bounds for Dynamic Algorithms |
136
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
128
Voted
MP
2010
15 years 2 months ago
2010
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
133
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
220
Voted
ACID
2006
15 years 5 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
137
click to vote
JAIR
2007
15 years 3 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...