Sciweavers

898 search results - page 14 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
UAI
1990
13 years 8 months ago
separable and transitive graphoids
We examine the notion of "unrelatedness" in a probabilistic framework. Three formulations are presented. In the first formulation, two variables a and b are totally inde...
Dan Geiger, David Heckerman
DCC
2006
IEEE
14 years 7 months ago
Codes with a Certain Weight-preserving Transitive Group of Automorphisms
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nont...
Michael Giudici
INFOCOM
2012
IEEE
11 years 9 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 1 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 7 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani