5269 search results - page 1023 / 1054 » order 2007 |
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
111
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
TACAS
2007
Springer
15 years 6 months ago
2007
Springer
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
TARK
2007
Springer
15 years 6 months ago
2007
Springer
Williamson (2000a) has argued that positive introspection is incompatible with inexact knowledge. His argument relies on a margin-for-error requirement for inexact knowledge based...