Sciweavers

84 search results - page 15 / 17
» corr 2009
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
CORR
2011
Springer
211views Education» more  CORR 2011»
12 years 11 months ago
Programming Massively Parallel Architectures using MARTE: a Case Study
—Nowadays, several industrial applications are being ported to parallel architectures. These applications take advantage of the potential parallelism provided by multiple core pr...
Antonio Wendell De Oliveira Rodrigues, Fréd...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
CVPR
2009
IEEE
15 years 2 months ago
Spatiotemporal Stereo via Spatiotemporal Quadric Element (Stequel) Matching
Spatiotemporal stereo is concerned with recovery of the 3D structure of a dynamically changing scene from a sequence of stereo images. This paper aims at computing temporally coh...
Mikhail Sizintsev, Richard P. Wildes
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 7 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener