Sciweavers

268 search results - page 52 / 54
» Cleaning Interval Graphs
Sort
View
SIGMOD
2007
ACM
195views Database» more  SIGMOD 2007»
15 years 10 months ago
Effective variation management for pseudo periodical streams
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Don...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 7 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
ICDCS
2009
IEEE
15 years 7 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
COCOON
2009
Springer
15 years 4 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
CGO
2008
IEEE
15 years 4 months ago
Latency-tolerant software pipelining in a production compiler
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...