1092 search results - page 150 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
169
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
157
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
260
click to vote
GIS
2004
ACM
16 years 7 months ago
2004
ACM
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
156
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...