Sciweavers

2612 search results - page 252 / 523
» Switching Graphs and Their Complexity
Sort
View
ICIP
2010
IEEE
15 years 3 months ago
Semi-supervised regression with temporal image sequences
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
Ling Xie, Miguel Á. Carreira-Perpiñ&...
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 3 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
AMW
2011
14 years 9 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
CONCUR
2011
Springer
14 years 5 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
IPPS
2006
IEEE
15 years 12 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch