Sciweavers

101 search results - page 19 / 21
» Newton's iterates can converge to non-stationary points
Sort
View
UAI
2004
14 years 11 months ago
Discretized Approximations for POMDP with Average Cost
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
Huizhen Yu, Dimitri P. Bertsekas
ICCV
2003
IEEE
15 years 11 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
MOBIHOC
2007
ACM
15 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
GMP
2008
IEEE
128views Solid Modeling» more  GMP 2008»
15 years 3 months ago
A Multistep Approach to Restoration of Locally Undersampled Meshes
The paper deals with the problem of remeshing and fairing of undersampled areas (called ”holes”) in triangular meshes. In this work, we are particularly interested in meshes co...
Alexandra Bac, Nam-Van Tran, Marc Daniel
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 1 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling