Sciweavers

3818 search results - page 297 / 764
» Word Problems on Compressed Words
Sort
View
MFCS
2005
Springer
16 years 5 days ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
Minming Li, Frances F. Yao
159
Voted
RTA
2005
Springer
16 years 4 days ago
Termination of Single-Threaded One-Rule Semi-Thue Systems
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
Wojciech Moczydlowski, Alfons Geser
ICPPW
2002
IEEE
15 years 11 months ago
Experiments with Parallelizing a Tribology Application
Different parallelization methods vary in their system requirements, programming styles, efficiency of exploring parallelism, and the application characteristics they can handle....
Vipin Chaudhary, W. L. Hase, Hai Jiang, L. Sun, Da...
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
15 years 11 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle