2778 search results - page 60 / 556 » Limit complexities revisited |
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
IJCM
2010
14 years 10 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
107
click to vote
CEC
2010
IEEE
15 years 28 days ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
108
click to vote
MCS
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
184
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...