8810 search results - page 1355 / 1762 » Open. Closed. Open |
165
click to vote
CPHYSICS
2010
15 years 7 months ago
2010
Distributed computing (DC) projects tackle large computational problems by exploiting the donated processing power of thousands of volunteered computers, connected through the Int...
166
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
163
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Nowadays, a popular method used for additive watermarking is wide spread spectrum. It consists in adding a spread signal into the host document. This signal is obtained by the sum...
184
click to vote
DATAMINE
2010
15 years 7 months ago
2010
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
189
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...