Author image not provided
 Chris M Bourke

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.13
Citation Count49
Publication count8
Publication years2005-2013
Available for download1
Average downloads per article495.00
Downloads (cumulative)495
Downloads (12 Months)11
Downloads (6 Weeks)0
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


8 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 8 of 8
Sort by:

1
January 2013 Machine Learning: Volume 90 Issue 1, January 2013
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 1

We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples' class labels but has to pay for each attribute that is specified. This learning model is appropriate in many areas, including medical applications. We present new algorithms for choosing which ...
Keywords: Budgeted learning, Multi-armed bandit

2
June 2010 CCC '10: Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem is equivalent to the NL vs L problem. This paper focuses on the reachability problem over planar graphs where the complexity is unknown. Showing ...
Keywords: acyclic digraph, logspace algorithm, planar graph, reachability

3 published by ACM
February 2009 ACM Transactions on Computation Theory (TOCT): Volume 1 Issue 1, February 2009
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Downloads (Overall): 484

Full text available: PDFPDF
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism. As our main result, we show a new upper bound on the directed planar reachability problem by showing that it can be decided in the ...
Keywords: Directed graph reachability, planar graphs, unambiguous log-space

4
June 2008 Machine Learning: Volume 71 Issue 2-3, June 2008
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 6

Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new conditions. We study the problem of reoptimizing a multi-class classifier based on its ROC hypersurface and a matrix describing the costs of each type of ...
Keywords: Multi-class classification, Classifier reoptimization, Receiver Operator Characteristic (ROC)

5
January 2008
Bibliometrics:
Citation Count: 0

Part I. We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism. As our main result, we show a new upper bound on the directed planar reachability problem by showing that it can be decided ...

6
October 2007 ICDM '07: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples' labels but has to pay for each attribute that is specified. This learning model is appropriate in many areas, including medical applications. We present new algorithms for choosing which attributes ...

7
June 2007 CCC '07: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 6

We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.

8
December 2005 Theoretical Computer Science: Volume 349 Issue 3, 16 December 2005
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 15

The effective fractal dimensions at the polynomial-space level and above can all be equivalently defined as the C -entropy rate where C is the class of languages corresponding to the level of effectivization. For example, pspace-dimension is equivalent to the PSPACE-entropy rate.At lower levels of complexity the equivalence proofs break ...
Keywords: finite-state dimension, normal sequences, regular languages



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us