Sciweavers

503 search results - page 64 / 101
» An Independence Relation for Sets of Secrets
Sort
View
CP
2008
Springer
14 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
SDM
2007
SIAM
162views Data Mining» more  SDM 2007»
14 years 11 months ago
Probabilistic Joint Feature Selection for Multi-task Learning
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
Tao Xiong, Jinbo Bi, R. Bharat Rao, Vladimir Cherk...
SPIESR
2004
171views Database» more  SPIESR 2004»
14 years 11 months ago
Interactive segmentation with hidden object-based annotations: toward smart media
In this paper a novel "Smart Media" concept for semantic-based multimedia security and management is proposed. This concept is based on interactive object segmentation (...
Yuriy Rytsar, Sviatoslav Voloshynovskiy, Fré...
SPIRE
2010
Springer
14 years 8 months ago
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
Yoram Bachrach, Ralf Herbrich
ICCBR
2009
Springer
14 years 7 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza