2693 search results - page 19 / 539 » On Computing Complex Navigation Functions |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
CHI
1995
ACM
15 years 1 months ago
1995
ACM
Large information spaces are often difficult to access efficiently and intuitively. We are exploring Pad++, a graphical interface system based on zooming, as an alternative to tra...
ESANN
2003
14 years 11 months ago
2003
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...