1469 search results - page 124 / 294 » Approximate polynomial decomposition |
101
click to vote
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
SECON
2010
IEEE
14 years 7 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
NA
2010
14 years 8 months ago
2010
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...