1805 search results - page 273 / 361 » Functional programming with structured graphs |
108
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
152
click to vote
ITP
2010
15 years 4 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
136
Voted
RC
2000
15 years 2 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
154
click to vote
AOSD
2003
ACM
15 years 7 months ago
2003
ACM
Middleware technologies such as Web Services, CORBA and DCOM have been very successful in solving distributed computing problems for a large family of application domains. As midd...
128
click to vote
EMMCVPR
2005
Springer
15 years 7 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...