5634 search results - page 310 / 1127 » About Abstract Classes |
136
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
160
Voted
ERSHOV
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
143
click to vote
FMCO
2006
Springer
15 years 8 months ago
2006
Springer
d Abstract) Vladimiro Sassone1 , Karl Krukow2 , and Mogens Nielsen2 1 ECS, University of Southampton 2 BRICS , University of Aarhus We define a mathematical measure for the quantit...
157
click to vote
FSTTCS
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
140
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...