Sciweavers

56 search results - page 10 / 12
» Learning Factor Graphs in Polynomial Time and Sample Complex...
Sort
View
114
Voted
WSC
2007
15 years 6 months ago
Work smarter, not harder: guidelines for designing simulation experiments
We present the basic concepts of experimental design, the types of goals it can address, and why it is such an important and useful tool for simulation. A well-designed experiment...
Susan M. Sanchez
172
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
141
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
130
Voted
ICML
2010
IEEE
15 years 4 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
127
Voted
UAI
2000
15 years 5 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan