Sciweavers

1887 search results - page 24 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
CAL
2010
13 years 4 months ago
SMT-Directory: Efficient Load-Load Ordering for SMT
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
A. Hilton, A. Roth
ICCV
2009
IEEE
1363views Computer Vision» more  ICCV 2009»
15 years 19 days ago
Human Detection Using Partial Least Squares Analysis
Significant research has been devoted to detecting people in images and videos. In this paper we describe a human detection method that augments widely used edge-based features ...
William Robson Schwartz, Aniruddha Kembhavi, David...
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 7 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
FLAIRS
2004
13 years 9 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar