101
click to vote
ICALP
15 years 2 months ago
2004 Springer 
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
ICALP
15 years 2 months ago
2004 Springer 
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
ICALP
15 years 2 months ago
2004 Springer 
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
ICALP
15 years 2 months ago
2004 Springer 
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
85
Voted
ICALP
15 years 2 months ago
2004 Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
|
Programming Languages