1092 search results - page 132 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
171
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
209
click to vote
PODS
2012
ACM
13 years 8 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 ...
158
click to vote
FSTTCS
2009
Springer
16 years 24 days ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
142
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
163
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...