1998 search results - page 217 / 400 » Complexity of the Cover Polynomial |
173
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
167
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
232
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
208
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
168
click to vote
ACSC
2005
IEEE
16 years 7 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...