4714 search results - page 361 / 943 » The Complexity of Iterated Multiplication |
214
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
154
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
168
click to vote
SEMWEB
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We present a novel approach to representing uncertain information in ontologies based on design patterns. We provide a brief description of our approach, present its use ...
149
click to vote
ICMCS
2005
IEEE
16 years 10 days ago
2005
IEEE
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
140
click to vote
AI
2003
Springer
15 years 12 months ago
2003
Springer
The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commoditi...