Sciweavers

58 search results - page 5 / 12
» Flow algorithms for two pipelined filter ordering problems
Sort
View
ACSC
2005
IEEE
14 years 10 days ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai
TON
2010
115views more  TON 2010»
13 years 1 months ago
Feedback-Based Scheduling for Load-Balanced Two-Stage Switches
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
Bing Hu, Kwan L. Yeung
COMGEO
2012
ACM
12 years 2 months ago
Routing multi-class traffic flows in the plane
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 8 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
ICDCS
1992
IEEE
13 years 10 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu