1478 search results - page 101 / 296 » Modular Complexity Analysis via Relative Complexity |
ISMIS
1999
Springer
14 years 1 months ago
1999
Springer
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
ISSAC
2004
Springer
14 years 2 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
ROBIO
2006
IEEE
14 years 3 months ago
2006
IEEE
— Many approaches to robotic grasping have focused on a specific aspect of the problem only, without considering its integrability with other related procedures in order to buil...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...