Sciweavers

796 search results - page 104 / 160
» The Anonymous Subgraph Problem
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
14 years 12 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
ASIACRYPT
2010
Springer
14 years 10 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
MM
2005
ACM
145views Multimedia» more  MM 2005»
15 years 5 months ago
Multiple instance learning for labeling faces in broadcasting news video
Labeling faces in news video with their names is an interesting research problem which was previously solved using supervised methods that demand significant user efforts on lab...
Jun Yang 0003, Rong Yan, Alexander G. Hauptmann
DAGSTUHL
2006
15 years 1 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
ITCC
2005
IEEE
15 years 5 months ago
A New Electronic Cash Model
- With the development of e-commerce, choosing a proper electronic payment method has become more and more important. Competing with other payment methods on the Internet, electron...
Xiaosong Hou, Chik How Tan