1355 search results - page 195 / 271 » Alternating Timed Automata over Bounded Time |
SIGMOD
2010
ACM
14 years 17 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
VLDB
1998
ACM
13 years 12 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
JCB
2006
13 years 7 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
TMC
2011
13 years 2 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...