Sciweavers

106 search results - page 15 / 22
» Average Case Analysis for Tree Labelling Schemes
Sort
View
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 1 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
CGF
2011
14 years 1 months ago
Prior Knowledge for Part Correspondence
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...
AINA
2007
IEEE
15 years 3 months ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl
BMCBI
2007
117views more  BMCBI 2007»
14 years 9 months ago
Supervised multivariate analysis of sequence groups to identify specificity determining residues
Background: Proteins that evolve from a common ancestor can change functionality over time, and it is important to be able identify residues that cause this change. In this paper ...
Iain M. Wallace, Desmond G. Higgins
TSP
2008
132views more  TSP 2008»
14 years 9 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...