1213 search results - page 49 / 243 » Approximation in quantale-enriched categories |
PAMI
2010
14 years 8 months ago
2010
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
DAC
2009
ACM
15 years 11 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
100
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
105
click to vote
PODS
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...