4698 search results - page 597 / 940 » Making Functionality More General |
181
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
212
click to vote
COCO
2005
Springer
16 years 5 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
213
Voted
NEUROSCIENCE
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. A general principle of cortical architecture is the bidirectional flow of information along feedforward and feedback connections. In the feedforward path, converging con...
184
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
194
Voted
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...