Sciweavers

2365 search results - page 119 / 473
» All things are connected
Sort
View
HYBRID
1997
Springer
15 years 5 months ago
Relating Time Progress and Deadlines in Hybrid Systems
Abstract. Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, d...
Sébastien Bornot, Joseph Sifakis
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 5 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
ICPR
2010
IEEE
15 years 3 months ago
Flooding and MRF-Based Algorithms for Interactive Segmentation
We propose a method for interactive colour image segmentation. The goal is to detect an object from the background, when some markers on object(s) and the background are given. As...
Ilias Grinias, Nikos Komodakis, G. Tziritas
ECBS
2008
IEEE
124views Hardware» more  ECBS 2008»
15 years 3 months ago
Hierarchical Model to Develop Component-Based Systems
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
Abdelkrim Amirat, Mourad Oussalah
CCCG
2010
15 years 3 months ago
3d local algorithm for dominating sets of unit disk graphs
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...