1213 search results - page 68 / 243 » Approximation in quantale-enriched categories |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
74
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
ISSAC
2007
Springer
15 years 4 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...