1968 search results - page 333 / 394 » The Complexity of Valued Constraint Models |
155
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
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...
AGILEDC
2004
IEEE
15 years 5 months ago
2004
IEEE
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...
132
click to vote
FORMATS
2008
Springer
15 years 2 months ago
2008
Springer
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...
106
click to vote
CIDR
2007
15 years 2 months ago
2007
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...
123
click to vote
DICTA
2003
15 years 2 months ago
2003
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 ...