6045 search results - page 176 / 1209 » Computable Linearizations of Well-partial-orderings |
TRANSCI
2010
13 years 6 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
ICCAD
2007
IEEE
14 years 5 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
KI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We propose a new EEG-based wireless brain computer interface (BCI) with which subjects can “mind-type” text on a computer screen. The application is based on detectin...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...