Sciweavers

115 search results - page 14 / 23
» The Complexity of List Ranking of Trees
Sort
View
FC
2007
Springer
125views Cryptology» more  FC 2007»
15 years 4 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
BMCBI
2007
217views more  BMCBI 2007»
14 years 10 months ago
On consensus biomarker selection
Background: Recent development of mass spectrometry technology enabled the analysis of complex peptide mixtures. A lot of effort is currently devoted to the identification of biom...
Janusz Dutkowski, Anna Gambin
ICALP
2001
Springer
15 years 2 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ECCV
2006
Springer
15 years 12 months ago
Feature Harvesting for Tracking-by-Detection
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
Mustafa Özuysal, Vincent Lepetit, Franç...
KES
2004
Springer
15 years 3 months ago
Multi-agent Web Recommendation Method Based on Indirect Association Rules
Recommendation systems often use association rules as main technique to discover useful links among the set of transactions, especially web usage data – historical user sessions....
Przemyslaw Kazienko