Sciweavers

14518 search results - page 323 / 2904
» Two Problems for Sophistication
Sort
View
173
Voted
CORR
2000
Springer
149views Education» more  CORR 2000»
15 years 6 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
WINE
2005
Springer
161views Economy» more  WINE 2005»
16 years 5 days ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
ACCV
2007
Springer
15 years 8 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
COMGEO
2010
ACM
15 years 6 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
148
Voted
ICCV
2001
IEEE
16 years 8 months ago
Noise in Bilinear Problems
: Despite the wide application of bilinear problems to problems both in computer vision and in other fields, their behaviour under the effects of noise is still poorly understood. ...
John A. Haddon, David A. Forsyth