3652 search results - page 357 / 731 » A study of query length |
119
click to vote
TIME
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitori...
108
click to vote
CIVR
2005
Springer
15 years 9 months ago
2005
Springer
Matching people based on their imaged face is hard because of the well known problems of illumination, pose, size and expression variation. Indeed these variations can exceed those...
117
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
101
click to vote
ISMIR
2005
Springer
15 years 9 months ago
2005
Springer
For melodic theme retrieval there is a fundamental tradeoff between retrieval performance and retrieval speed. Melodic representations of large dimension yield the best retrieval ...
156
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...