Sciweavers

661 search results - page 41 / 133
» Levels of a scale-free tree
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
IPCV
2008
13 years 11 months ago
Weighted Embedded Zero Tree for Scalable Video Compression
Video streaming over the Internet has gained popularity during recent years mainly due to the revival of videoconferencing and videotelephony applications and the proliferation of ...
Roya Choupani, Stephan Wong, Mehmet R. Tolun
ACL
1998
13 years 11 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
TIP
2008
219views more  TIP 2008»
13 years 9 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 6 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen