Sciweavers

1399 search results - page 89 / 280
» New Algorithms for k-Center and Extensions
Sort
View
CN
2007
102views more  CN 2007»
13 years 9 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
ADC
2008
Springer
139views Database» more  ADC 2008»
14 years 3 months ago
Computing Structural Similarity of Source XML Schemas against Domain XML Schema
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Jixue Liu...
COLT
2007
Springer
14 years 3 months ago
Online Learning with Prior Knowledge
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
Elad Hazan, Nimrod Megiddo
EUROCOLT
1995
Springer
14 years 20 days ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
CVPR
1998
IEEE
14 years 11 months ago
An Optimized Interaction Strategy for Bayesian Relevance Feedback
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...