Sciweavers

777 search results - page 121 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
QEST
2008
IEEE
14 years 3 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 11 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
COMPGEOM
2010
ACM
14 years 29 days ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
ACCV
2009
Springer
14 years 3 months ago
An Online Framework for Learning Novel Concepts over Multiple Cues
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
Luo Jie, Francesco Orabona, Barbara Caputo
EUROPAR
2009
Springer
14 years 3 months ago
Scheduling Recurrent Precedence-Constrained Task Graphs on a Symmetric Shared-Memory Multiprocessor
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
UmaMaheswari C. Devi