186 search results - page 35 / 38 » Improved approximation algorithms for directed Steiner fores... |
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
BMCBI
2007
13 years 7 months ago
2007
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
SI3D
1999
ACM
13 years 11 months ago
1999
ACM
In the real world designers often use French curves or sweeps to create or edit curves to bring out a personal style or reflect a corporate standard in all their designs. A Frenc...