Sciweavers

451 search results - page 20 / 91
» Learning conditional preference networks
Sort
View
ICML
2010
IEEE
13 years 8 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
WAC
2004
Springer
14 years 27 days ago
A Unified Framework for the Negotiation and Deployment of Network Services
The Internet network technology today does not allow a sufficient degree of autonomy to express user choices, constraints and preferences in order to dynamically obtain the most su...
Spyros G. Denazis, Lidia Yamamoto
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
14 years 1 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
BROADNETS
2005
IEEE
14 years 1 months ago
Multi layer rules based framework for vertical handoff
— Seamless interoperability between two dissimilar networks require handoff from one network to the other. Such handoffs are known as vertical handoffs. Vertical handoff introduc...
Abhijit Sur, Douglas C. Sicker
FPLAY
2008
13 years 9 months ago
Exaggerated head motions for game viewpoint control
In this paper, we present an evaluation of exaggerated headcoupled camera motions in a game-like 3D object movement. Three exaggeration levels were compared to determine if the ex...
Robert J. Teather, Wolfgang Stürzlinger