Sciweavers

1220 search results - page 210 / 244
» Restricting grammatical complexity
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
GG
2008
Springer
13 years 9 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
SIGCOMM
2010
ACM
13 years 8 months ago
c-Through: part-time optics in data centers
Data-intensive applications that operate on large volumes of data have motivated a fresh look at the design of data center networks. The first wave of proposals focused on designi...
Guohui Wang, David G. Andersen, Michael Kaminsky, ...

Publication
353views
13 years 8 months ago
Online Multi-Person Tracking-by-Detection from a Single, Uncalibrated Camera
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex scenes using a monocular, potentially moving, uncalibrated ca...
Michael D. Breitenstein, Fabian Reichlin, Bastian ...
APAL
2007
111views more  APAL 2007»
13 years 8 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons