137 search results - page 26 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
CCA
2009
Springer
14 years 20 days ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
SWAT
1992
Springer
14 years 3 days ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
IJCAI
1989
13 years 9 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
P2P
2008
IEEE
14 years 2 months ago
2008
IEEE
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
TALG
2010
13 years 2 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...