900 search results - page 35 / 180 » On Polynomial Time Computation over Unordered Structures |
ASIACRYPT
2004
Springer
14 years 2 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
MPEG-4 Advanced Simple Profile video provides I, P, and B –type frames in each GOP (Group Of Pictures). To maximize the coding efficiency, it is important to determine the distr...
SDMW
2004
Springer
14 years 2 months ago
2004
Springer
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
SDM
2007
SIAM
13 years 10 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,...