Sciweavers

14121 search results - page 490 / 2825
» Interval Computations in Computer Vision
Sort
View
STACS
2005
Springer
16 years 11 days ago
Pattern Occurrences in Multicomponent Models
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
Massimiliano Goldwurm, Violetta Lonati
WG
1992
Springer
15 years 11 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
CONEXT
2008
ACM
15 years 8 months ago
Recursive temporal namespaces
Recursive temporal (RT) namespaces extend spatial namespaces such as IP with the notion of a nested time interval. RT namespace is an architectural approach to dealing with the un...
Venkata K. Pingali, Joseph D. Touch
IPL
2010
115views more  IPL 2010»
15 years 5 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
ICALP
2009
Springer
16 years 7 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak