Sciweavers

2446 search results - page 111 / 490
» Choiceless Polynomial Time
Sort
View
103
Voted
ICPR
2008
IEEE
16 years 1 months ago
Securing fingerprint template: Fuzzy vault with minutiae descriptors
Fuzzy vault has been shown to be an effective technique for securing fingerprint minutiae templates. Its security depends on the difficulty in identifying the set of genuine minut...
Abhishek Nagar, Anil K. Jain, Karthik Nandakumar
90
Voted
ICML
2004
IEEE
16 years 1 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
101
Voted
CADE
2006
Springer
16 years 1 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 1 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
89
Voted
DAC
2009
ACM
15 years 7 months ago
Variational capacitance extraction of on-chip interconnects based on continuous surface model
In this paper we present a continuous surface model to describe the interconnect geometric variation, which improves the currently used model for better accuracy while not increas...
Wenjian Yu, Chao Hu, Wangyang Zhang