Sciweavers

765 search results - page 102 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 4 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
16 years 6 days ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
BMCBI
2008
128views more  BMCBI 2008»
14 years 12 months ago
Nonparametric relevance-shifted multiple testing procedures for the analysis of high-dimensional multivariate data with small sa
Background: In many research areas it is necessary to find differences between treatment groups with several variables. For example, studies of microarray data seek to find a sign...
Cornelia Frömke, Ludwig A. Hothorn, Siegfried...
WWW
2008
ACM
16 years 15 days ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
ROBOCUP
2007
Springer
153views Robotics» more  ROBOCUP 2007»
15 years 6 months ago
Model-Based Reinforcement Learning in a Complex Domain
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
Shivaram Kalyanakrishnan, Peter Stone, Yaxin Liu