Sciweavers

2721 search results - page 241 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 7 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
DKE
2002
218views more  DKE 2002»
15 years 6 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
190
Voted
CVPR
2005
IEEE
16 years 8 months ago
A Semi-Supervised Active Learning Framework for Image Retrieval
Although recent studies have shown that unlabeled data are beneficial to boosting the image retrieval performance, very few approaches for image retrieval can learn with labeled a...
Steven C. H. Hoi, Michael R. Lyu
CVPR
2006
IEEE
16 years 8 months ago
Efficient Optimal Kernel Placement for Reliable Visual Tracking
This paper describes a novel approach to optimal kernel placement in kernel-based tracking. If kernels are placed at arbitrary places, kernel-based methods are likely to be trappe...
Zhimin Fan, Ming Yang, Ying Wu, Gang Hua, Ting Yu