Sciweavers

693 search results - page 23 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
AINA
2007
IEEE
15 years 8 months ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl
ICIP
1998
IEEE
16 years 3 months ago
An Efficient Motion Estimation Algorithm based on Tracing Techniques on Large Search Windows
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
Marco Mattavelli, Giorgio Zoia
105
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 2 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
121
Voted
JMLR
2006
117views more  JMLR 2006»
15 years 1 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
WSC
1998
15 years 3 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan