Sciweavers

256 search results - page 8 / 52
» Root shadow spaces
Sort
View
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
14 years 16 days ago
Implementation of a Shadow Carving System for Shape Capture
—We present a new technique for estimating the 3D shape of an object that combines previous ideas from shape from silhouettes and shape from shadows. We begin with a set-up for r...
Silvio Savarese, Holly E. Rushmeier, Fausto Bernar...
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
13 years 11 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz
TC
2008
13 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
ENGL
2008
192views more  ENGL 2008»
13 years 7 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
EJC
2007
13 years 7 months ago
An integrality theorem of root systems
Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
A. Bhattacharya, G. R. Vijayakumar