Sciweavers

2181 search results - page 83 / 437
» The restriction scaffold problem
Sort
View
IPL
2002
90views more  IPL 2002»
13 years 9 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
ICASSP
2011
IEEE
13 years 1 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
CVPR
2006
IEEE
14 years 12 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
LATA
2009
Springer
14 years 4 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
CPA
1995
143views Cryptology» more  CPA 1995»
14 years 1 months ago
Crypto in Europe - Markets, Law and Policy
Much of the debate on cryptography has assumed that the real tension is between the state’s desire for effective policing and the privacy of the individual. We argue that this i...
Ross J. Anderson