Sciweavers

134 search results - page 14 / 27
» A note on generalized chromatic number and generalized girth
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
TCS
2011
13 years 2 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon
AAAI
2011
12 years 7 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
SIGMOD
2003
ACM
96views Database» more  SIGMOD 2003»
14 years 7 months ago
Toward network data independence
A number of researchers have become interested in the design of global-scale networked systems and applications. Our thesis here is that the database community's principles a...
Joseph M. Hellerstein
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca