Sciweavers

148 search results - page 7 / 30
» The random Tukey depth
Sort
View
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
13 years 11 months ago
Linear-time encodable and decodable error-correcting codes
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
Daniel A. Spielman
CAIP
2009
Springer
257views Image Analysis» more  CAIP 2009»
13 years 5 months ago
On the Recovery of Depth from a Single Defocused Image
Abstract. In this paper we address the challenging problem of recovering the depth of a scene from a single image using defocus cue. To achieve this, we first present a novel appro...
Shaojie Zhuo, Terence Sim
IJISTA
2008
99views more  IJISTA 2008»
13 years 7 months ago
Increasing depth lateral resolution based on sensor fusion
Abstract: Technologies for measuring range data were intensively developed in recent years. The time-of-flight matrix range sensor is one of the most active range acquisition devic...
W. Hannemann, André Linarth, B. Liu, Gabrie...
FOCS
2002
IEEE
14 years 15 days ago
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi...
DICTA
2007
13 years 9 months ago
An in Depth Comparison of Four Texture Segmentation Methods
Texture segmentation is the process of partitioning an image into regions with different textures containing similar group of pixels. This paper presents a comparative study of fo...
Vamsi Krishna Madasu, Prasad K. D. V. Yarlagadda