2080 search results - page 386 / 416 » Measuring empirical computational complexity |
159
Voted
SOFTWARE
2008
15 years 4 months ago
2008
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
147
click to vote
LOGCOM
2007
15 years 4 months ago
2007
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
141
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
218
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
174
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...