Sciweavers

11151 search results - page 2129 / 2231
» On the Complexity of Model Expansion
Sort
View
CCA
2009
Springer
14 years 5 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
CIVR
2009
Springer
192views Image Analysis» more  CIVR 2009»
14 years 5 months ago
Example based video filters
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C....
CPAIOR
2009
Springer
14 years 5 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
EMSOFT
2009
Springer
14 years 5 months ago
Compositional deadlock detection for rendezvous communication
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...
Baolin Shao, Nalini Vasudevan, Stephen A. Edwards
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 5 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
« Prev « First page 2129 / 2231 Last » Next »