Sciweavers

4378 search results - page 623 / 876
» On the Complexity of Ordered Colourings
Sort
View
178
Voted
ICCV
1995
IEEE
15 years 10 months ago
Topologically Adaptable Snakes
This paper presents a topologically adaptable snakes model for image segmentation and object representation. The model is embedded in the framework of domain subdivision using sim...
Tim McInerney, Demetri Terzopoulos
PODC
1995
ACM
15 years 10 months ago
A Framework for Protocol Composition in Horus
The Horus system supports a communication architecture ats protocols as instances of an abstract data type. This approach encourages developers to partition complex protocols into...
Robbert van Renesse, Kenneth P. Birman, Roy Friedm...
FM
1991
Springer
164views Formal Methods» more  FM 1991»
15 years 10 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin
HT
1991
ACM
15 years 10 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman
LICS
1989
IEEE
15 years 10 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning