364 search results - page 13 / 73 » Dimension Characterizations of Complexity Classes |
DIMACS
2001
13 years 8 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
COMPGEOM
2010
ACM
14 years 12 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
EPEW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...