Sciweavers

12257 search results - page 2165 / 2452
» Analysis of Algorithms
Sort
View
156
Voted
FCT
2009
Springer
15 years 8 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
IAT
2009
IEEE
15 years 8 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
ICIP
2007
IEEE
15 years 8 months ago
Lipreading by Locality Discriminant Graph
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
Yun Fu, Xi Zhou, Ming Liu, Mark Hasegawa-Johnson, ...
3DPVT
2006
IEEE
247views Visualization» more  3DPVT 2006»
15 years 7 months ago
Contour-Based Object Detection in Range Images
This paper presents a novel object recognition approach based on range images. Due to its insensitivity to illumination, range data is well suited for reliable silhouette extracti...
Stefan Stiene, Kai Lingemann, Andreas Nüchter...
BPM
2004
Springer
148views Business» more  BPM 2004»
15 years 7 months ago
Interactive Workflow Mining
Many information systems log event data about executed tasks. Workflow mining is concerned with the derivation of a graphical workflow model out of this data. Experience from appl...
Markus Hammori, Joachim Herbst, Niko Kleiner
« Prev « First page 2165 / 2452 Last » Next »