Sciweavers

1949 search results - page 220 / 390
» Random graphs on surfaces
Sort
View
WWW
2009
ACM
16 years 6 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
ICIP
2008
IEEE
16 years 14 days ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 7 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
DAM
2010
92views more  DAM 2010»
15 years 6 months ago
Average-case analysis of incremental topological ordering
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
Deepak Ajwani, Tobias Friedrich
STACS
2010
Springer
16 years 1 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...