2703 search results - page 310 / 541 » Working Class Hero |
211
click to vote
ECCC
2007
15 years 6 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
196
click to vote
JMLR
2006
15 years 6 months ago
2006
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special T...
157
click to vote
MP
2006
15 years 6 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
177
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
200
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...