Sciweavers

2492 search results - page 100 / 499
» On the General Signature Trees
Sort
View
TALG
2008
67views more  TALG 2008»
13 years 10 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
CCR
2004
113views more  CCR 2004»
13 years 10 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
DATE
2008
IEEE
143views Hardware» more  DATE 2008»
14 years 4 months ago
Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of car...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
SAC
2006
ACM
14 years 4 months ago
Facial emotion recognition by adaptive processing of tree structures
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...
Jia-Jun Wong, Siu-Yeung Cho
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
14 years 3 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev