5100 search results - page 856 / 1020 » The Linear Complexity of a Graph |
172
click to vote
COLT
2007
Springer
16 years 16 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
192
click to vote
CSR
2007
Springer
16 years 15 days ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
183
click to vote
EDUTAINMENT
2007
Springer
16 years 15 days ago
2007
Springer
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
171
click to vote
EUROCRYPT
2007
Springer
16 years 15 days ago
2007
Springer
sion of an extended abstract to be published in Advances in Cryptology—EUROCRYPT 2007, Springer-Verlag, 2007. Available online from the IACR Cryptology ePrint Archive as Report 2...
162
click to vote
EVOW
2007
Springer
16 years 15 days ago
2007
Springer
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...