3220 search results - page 273 / 644 » Constrained Graph Processes |
148
click to vote
FASE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
228
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
161
click to vote
ICMCS
2006
IEEE
16 years 18 days ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
177
click to vote
GD
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
199
click to vote
PPSWR
2005
Springer
16 years 1 days ago
2005
Springer
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...