Sciweavers

280 search results - page 48 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
IJCV
2008
157views more  IJCV 2008»
14 years 9 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
116
Voted
CEC
2011
IEEE
13 years 9 months ago
Curiosity-driven optimization
— The principle of artificial curiosity directs active exploration towards the most informative or most interesting data. We show its usefulness for global black box optimizatio...
Tom Schaul, Yi Sun, Daan Wierstra, Faustino J. Gom...
172
Voted
EMMCVPR
2011
Springer
13 years 9 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
14 years 11 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
SIGIR
2011
ACM
14 years 8 days ago
Utilizing marginal net utility for recommendation in e-commerce
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
Jian Wang, Yi Zhang