1951 search results - page 145 / 391 » An algorithm for improving graph partitions |
152
click to vote
SIROCCO
2008
15 years 6 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
139
Voted
ICDAR
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper presents a new enhanced text extraction algorithm from degraded document images on the basis of the probabilistic models. The observed document image is considered as a...
156
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
130
Voted
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
135
Voted
ICESS
2007
Springer
15 years 10 months ago
2007
Springer
In an embedded system including a base processor integrated with a tightly coupled accelerator, extracting frequently executed portions of the code (hot portion) and executing thei...