Sciweavers

4047 search results - page 507 / 810
» The Discrete Basis Problem
Sort
View
153
Voted
EMMCVPR
2005
Springer
15 years 10 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
NSPW
2004
ACM
15 years 10 months ago
The user non-acceptance paradigm: INFOSEC's dirty little secret
(by Victor Raskin) This panel will address users’ perceptions and misperceptions of the risk/benefit and benefit/nuisance ratios associated with information security products, an...
Steven J. Greenwald, Kenneth G. Olthoff, Victor Ra...
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Robust incentive techniques for peer-to-peer networks
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
Michal Feldman, Kevin Lai, Ion Stoica, John Chuang
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
122
Voted
ECAI
2004
Springer
15 years 10 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano