Sciweavers

724 search results - page 40 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 5 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 5 days ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
CVPR
2005
IEEE
16 years 1 months ago
Multilabel Random Walker Image Segmentation Using Prior Models
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
Leo Grady
CEC
2005
IEEE
15 years 5 months ago
Statistical optimisation and tuning of GA factors
This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is...
Andrei Petrovski, Alexander E. I. Brownlee, John A...
3DIM
2003
IEEE
15 years 3 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick