Sciweavers

1298 search results - page 96 / 260
» The online set cover problem
Sort
View
VLDB
2006
ACM
190views Database» more  VLDB 2006»
16 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 6 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
ICWE
2004
Springer
15 years 11 months ago
A Scalable Component-Based Architecture for Online Services of Library Catalogs
Abstract. In recent years, more and more publications and material for studying and teaching, e. g. for Web-based teaching (WBT), appear "online" and digital libraries ar...
Marcus Flehmig
AIPS
2007
15 years 8 months ago
Online Planning for Resource Production in Real-Time Strategy Games
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 3 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu