Sciweavers

5606 search results - page 202 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICDAR
2007
IEEE
15 years 7 months ago
Document Image Segmentation Using a 2D Conditional Random Field Model
This work relates to the implementation of a 2D conditional random field model in the context of document image analysis. Our model makes it possible to take variability into acco...
Stéphane Nicolas, J. Dardenne, Thierry Paqu...
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
14 years 10 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
CSFW
2010
IEEE
15 years 4 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
IWCMC
2010
ACM
15 years 2 months ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton
81
Voted
ICC
2008
IEEE
15 years 7 months ago
A Two-Stage Sensing Technique for Dynamic Spectrum Access
—Dynamic spectrum access (DSA) is a promising approach for mitigating spectrum scarcity. Underlying DSA is the need for fast and reliable spectrum sensing over a potentially larg...
Ling Luo, Sumit Roy