Sciweavers

1484 search results - page 67 / 297
» Ants meeting algorithms
Sort
View
COLT
2006
Springer
14 years 1 months ago
Online Learning Meets Optimization in the Dual
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
KDD
2008
ACM
121views Data Mining» more  KDD 2008»
14 years 10 months ago
Reconstructing chemical reaction networks: data mining meets system identification
We present an approach to reconstructing chemical reaction networks from time series measurements of the concentrations of the molecules involved. Our solution strategy combines t...
Yong Ju Cho, Naren Ramakrishnan, Yang Cao
COLT
2005
Springer
14 years 3 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
WWW
2006
ACM
14 years 10 months ago
Adaptive web sites: user studies and simulation
Adaptive web sites have been proposed to enhance ease of navigation and information retrieval. A variety of approaches are described in the literature, but consideration of interf...
Doug Warner, Stephen D. Durbin, J. Neal Richter, Z...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 4 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...