Sciweavers

1884 search results - page 119 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 2 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 4 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 4 months ago
Improving Transaction-Time DBMS Performance and Functionality
Immortal DB is a transaction time database system that is built into a commercial database system rather than being layered on top. This enables it to have performance that is very...
David B. Lomet, Feifei Li
BDIM
2007
IEEE
58views Business» more  BDIM 2007»
15 years 8 months ago
Derivation of Response Time Service Level Objectives for Business Services
— Design of Service Level Agreements (SLAs) emerges as an increasingly important discipline in business-oriented IT management. In this work, we study utility maximization of con...
David Breitgand, Elean A. Henis, Onn Shehory, John...
IBPRIA
2007
Springer
15 years 8 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...