3220 search results - page 60 / 644 » Constrained Graph Processes |
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
Decomposition of cells in clumps is a difficult segmentation task requiring region splitting techniques. Techniques that do not employ prior shape constraints usually fail to achi...
NAACL
2010
13 years 7 months ago
2010
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
EUROMICRO
1998
IEEE
14 years 2 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
ICSM
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
SIROCCO
2010
13 years 11 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...