Sciweavers

1749 search results - page 220 / 350
» Conditional colorings of graphs
Sort
View
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 8 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
16 years 1 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
ICESS
2007
Springer
16 years 26 days ago
Handling Control Data Flow Graphs for a Tightly Coupled Reconfigurable Accelerator
In an embedded system including a base processor integrated with a tightly coupled accelerator, extracting frequently executed portions of the code (hot portion) and executing thei...
Hamid Noori, Farhad Mehdipour, Morteza Saheb Zaman...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
16 years 25 days ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
ECCV
2010
Springer
16 years 1 days ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...