Sciweavers

1887 search results - page 2 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 6 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 6 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
RSA
2008
85views more  RSA 2008»
13 years 4 months ago
On a universal best choice algorithm for partially ordered sets
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 5 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta