Sciweavers

1390 search results - page 37 / 278
» Computing the depth of a flat
Sort
View
ICPR
2010
IEEE
14 years 10 months ago
Dynamic Hand Pose Recognition Using Depth Data
—Hand pose recognition has been a problem of great interest to the Computer Vision and Human Computer Interaction community for many years and the current solutions either requir...
Poonam Suryanarayan, Anbumani Subramanian, Dinesh ...
FOCS
1992
IEEE
15 years 1 months ago
Separating the Communication Complexities of MOD m and MOD p Circuits
: We prove in this paper that it is much harder to evaluate depth
Vince Grolmusz
ICPR
2008
IEEE
15 years 11 months ago
Improved novel view synthesis from depth image with large baseline
In this paper, a new algorithm is developed for recovering the large disocclusion regions in depth image based rendering (DIBR) systems on 3DTV. For the DIBR systems, undesirable ...
Chia-Ming Cheng, Jinn-Cherng Yang, Shang-Hong Lai,...
LREC
2008
97views Education» more  LREC 2008»
14 years 11 months ago
Clustering of Terms from Translation Dictionaries and Synonyms Lists to Automatically Build more Structured Linguistic Resources
Building a Linguistic Resource (LR) is a task requiring a huge quantitative of means, human resources and funds. Though finalization of the development phase and assessment of the...
Maria Teresa Pazienza, Armando Stellato
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri