Sciweavers

1067 search results - page 172 / 214
» Probabilistic regular graphs
Sort
View
IJCAI
2003
15 years 1 months ago
A Learning Algorithm for Web Page Scoring Systems
Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique...
Michelangelo Diligenti, Marco Gori, Marco Maggini
120
Voted
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
15 years 1 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
AIPS
1996
15 years 1 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
88
Voted
DM
2008
82views more  DM 2008»
15 years 16 days ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
98
Voted
CPC
2002
80views more  CPC 2002»
15 years 8 days ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger