Sciweavers

32 search results - page 3 / 7
» Comparing probability measures using possibility theory: A n...
Sort
View
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
IANDC
2006
103views more  IANDC 2006»
13 years 5 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
WWW
2007
ACM
14 years 6 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin
SPIRE
2005
Springer
13 years 11 months ago
A Model for Information Retrieval Based on Possibilistic Networks
This paper proposes a model for Information Retrieval (IR) based on possibilistic directed networks. Relations documents-terms and query-terms are modeled through possibility and n...
Asma Brini, Mohand Boughanem, Didier Dubois
ALT
2007
Springer
13 years 12 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud