2370 search results - page 139 / 474 » The Characterization of Data-Accumulating Algorithms |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract—This paper proposes a simple but effective admission control algorithm for integrated services packet networks. The admission control scheme, based on stochastic control...
SIBGRAPI
1999
IEEE
15 years 2 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...