Sciweavers

1096 search results - page 36 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 2 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
ICIP
2006
IEEE
15 years 11 months ago
On the Use of Metrics for Multi-Dimensional Descriptors Clustering
The Visual Thesaurus is a new query approach when no starting image is available. It is a concise representation of all similar regions in a panel of visual patches; the user arra...
Hichem Houissa, Nozha Boujemaa
FSE
2001
Springer
116views Cryptology» more  FSE 2001»
15 years 2 months ago
NESSIE: A European Approach to Evaluate Cryptographic Algorithms
The NESSIE project (New European Schemes for Signature, Integrity and Encryption) intends to put forward a portfolio containing the next generation of cryptographic primitives. The...
Bart Preneel
PUK
2000
14 years 11 months ago
An Accessibility graph learning approach for task planning in large domains
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...
Emmanuel Guere, Rachid Alami
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
14 years 11 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...