Sciweavers

526 search results - page 47 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VLDB
2002
ACM
141views Database» more  VLDB 2002»
13 years 9 months ago
A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
André Seifert, Marc H. Scholl
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 8 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
ICCV
2001
IEEE
15 years 4 days ago
Topology Free Hidden Markov Models: Application to Background Modeling
Hidden Markov Models (HMMs) are increasingly being used in computer vision for applications such as: gesture analysis, action recognition from video, and illumination modeling. Th...
Bjoern Stenger, Visvanathan Ramesh, Nikos Paragios...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 12 months ago
Online Anomaly Prediction for Robust Cluster Systems
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
Xiaohui Gu, Haixun Wang