Sciweavers

43 search results - page 7 / 9
» Calculating lower bounds for caching problems
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 9 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
BIOINFORMATICS
2011
12 years 11 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
PODC
2010
ACM
13 years 11 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
IPPS
2006
IEEE
14 years 1 months ago
QoS-based management of multiple shared resource in dynamic real-time systems
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
Klaus H. Ecker, Frank Drews, Jens Lichtenberg
CISS
2008
IEEE
14 years 1 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar