5128 search results - page 689 / 1026 » When Abstraction Fails |
174
click to vote
APPROX
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
166
click to vote
APWEB
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Essential to an audience driven website design philosophy is the organization of information and functionality according to the requirements of the different audience cla...
159
click to vote
ASIACRYPT
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
165
click to vote
ATVA
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
183
click to vote
AUSAI
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Principal Component Analysis (PCA) plus Linear Discriminant Analysis (LDA) (PCA+LDA) and LDA/QR are both two-stage methods that deal with the small sample size (SSS) prob...