Sciweavers

1632 search results - page 254 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
118
Voted
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
15 years 9 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
138
Voted
DEXA
2005
Springer
160views Database» more  DEXA 2005»
15 years 9 months ago
Improved Sequential Pattern Mining Using an Extended Bitmap Representation
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
Chien-Liang Wu, Jia-Ling Koh, Pao-Ying An
127
Voted
PPDP
2010
Springer
15 years 1 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
160
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 9 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
135
Voted
IDEAS
2002
IEEE
113views Database» more  IDEAS 2002»
15 years 8 months ago
Scalable QoS-Aware Disk-Scheduling
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
Walid G. Aref, Khaled El-Bassyouni, Ibrahim Kamel,...