16430 search results - page 882 / 3286 » On Computable Tree Functions |
198
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
195
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
210
click to vote
PKC
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
234
click to vote
PERCOM
2003
ACM
16 years 7 months ago
2003
ACM
Pervasive computing environments add a multitude of additional devices to our current computing landscapes. Specialized embedded systems provide sensor information about the real ...
194
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...