Sciweavers

5962 search results - page 41 / 1193
» Efficient Clustering for Orders
Sort
View
145
Voted
ACST
2006
15 years 3 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 2 months ago
An efficient algorithm for partial order production
Gwenaël Joret, J. Ian Munro, Jean Cardinal, R...
CGF
2000
83views more  CGF 2000»
15 years 1 months ago
A novel approach makes higher order wavelets really efficient for radiosity
Since wavelets were introduced in the radiosity algorithm5, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previou...
François Cuny, Laurent Alonso, Nicolas Holz...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 2 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 5 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...