Sciweavers

2434 search results - page 93 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
126
Voted
WG
2010
Springer
15 years 1 months ago
Efficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...
140
Voted
IEEECIT
2010
IEEE
15 years 1 months ago
Adaptive Algorithms for Efficient Content Management in Social Network Services
Identifying the set of resources that are expected to receive the majority of requests in the near future, namely hot set, is at the basis of most content management strategies of...
Claudia Canali, Michele Colajanni, Riccardo Lancel...
149
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ISCI
1998
91views more  ISCI 1998»
15 years 3 months ago
The Improper Fuzzy Riemann Integral and its Numerical Integration
The improper fuzzy Riemann integral and its numerical integration are proposed in this paper. Under the setting of the improper fuzzy Riemann integral, we can ®nd the expectation...
Hsien-Chung Wu
126
Voted
ICTAI
2006
IEEE
15 years 9 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan