Sciweavers

ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Tree-Approximations for the Weighted Cost-Distance Problem
Christian Schindelhauer, Birgitta Weber
ISAAC
2001
Springer
103views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Labeling Points with Weights
Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alex...
ISAAC
2001
Springer
118views Algorithms» more  ISAAC 2001»
14 years 2 months ago
On Adaptive Fault Diagnosis for Multiprocessor Systems
Abstract. We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N + t − 1 tests, which is the smallest possibl...
Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
ISAAC
2001
Springer
103views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Enumerating Floorplans with n Rooms
Shin-Ichi Nakano
ISAAC
2001
Springer
106views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Suffix Vector: A Space-Efficient Suffix Tree Representation
Krisztián Monostori, Arkady B. Zaslavsky, I...
ISAAC
2001
Springer
99views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Efficient Algorithms for Two Generalized 2-Median Problems on Trees
Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Ch...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
14 years 2 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...