An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
To maximize the velocity of business value delivery, Alistair Cockburn talks of having a process that is "barely sufficient." At Landmark Graphics we developed some guid...
Todd Little, Forrest Greene, Tessy Phillips, Rex P...
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
Abstract. Mahalanobis distance has already proved its strength in human skin detection using a set of skin values. We present this work that uses automatic skin detection after an ...