4759 search results - page 241 / 952 » Parallelizing the Phylogeny Problem |
ICCV
2001
IEEE
16 years 4 months ago
2001
IEEE
: Despite the wide application of bilinear problems to problems both in computer vision and in other fields, their behaviour under the effects of noise is still poorly understood. ...
113
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
141
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
145
Voted
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
140
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...