Sciweavers

623 search results - page 10 / 125
» Efficient Algorithms for Two Generalized 2-Median Problems o...
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 19 days ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
FOCS
2009
IEEE
14 years 9 days ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICPADS
2005
IEEE
14 years 2 months ago
MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...
Su-Wei Tan, A. Gill Waters, John S. Crawford
FCT
2003
Springer
14 years 1 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 2 days ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...