Sciweavers

206 search results - page 39 / 42
» Better Bounds for Online Scheduling
Sort
View
DASFAA
2004
IEEE
134views Database» more  DASFAA 2004»
13 years 11 months ago
Applying Co-training to Clickthrough Data for Search Engine Adaptation
The information on the World Wide Web is growing without bound. Users may have very diversified preferences in the pages they target through a search engine. It is therefore a chal...
Qingzhao Tan, Xiaoyong Chai, Wilfred Ng, Dik Lun L...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 9 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 7 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
IJRR
2010
102views more  IJRR 2010»
13 years 6 months ago
Space-carving Kernels for Accurate Rough Terrain Estimation
Abstract— Accurate terrain estimation is critical for autonomous offroad navigation. Reconstruction of a 3D surface allows rough and hilly ground to be represented, yielding fast...
Raia Hadsell, J. Andrew Bagnell, Daniel F. Huber, ...
INFOCOM
2003
IEEE
14 years 24 days ago
Providing Guaranteed Rate Services in the Load Balanced Birkhoff-von Neumann Switches
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
Cheng-Shang Chang, Duan-Shin Lee, Chi-Yao Yue