Sciweavers

502 search results - page 39 / 101
» Verifying Balanced Trees
Sort
View
AMAST
2008
Springer
13 years 12 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
CMS
2001
133views Communications» more  CMS 2001»
13 years 11 months ago
Asynchronous Large-Scale Certification Based on Certificate Verification Trees
Good public-key infrastructures (PKIs) are essential to make electronic commerce secure. Quite recently, certificate verification trees (CVTs) have been introduced as a tool for im...
M. Mar Albà, Josep Domingo-Ferrer, Francesc...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 11 days ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
EUC
2008
Springer
13 years 11 months ago
Trusted Spanning Tree for Delay Tolerant MANETs
Quality of service is an important issue in Delay Tolerant Mobile Ad-Hoc Networks (DTMs). This work attempts to improve the Quality of service (QoS) in DTMs by relying on spanning...
Apivadee Piyatumrong, Pascal Bouvry, Fréd&e...
ACCV
2009
Springer
14 years 4 months ago
From Ramp Discontinuities to Segmentation Tree
Abstract. This paper presents a new algorithm for low-level multiscale segmentation of images. The algorithm is designed to detect image regions regardless of their shapes, sizes, ...
Emre Akbas, Narendra Ahuja