536 search results - page 13 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
TCS
2008
13 years 7 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
EOR
2007
13 years 7 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...