Sciweavers

4137 search results - page 706 / 828
» On the number of matchings of a tree
Sort
View
ALT
2010
Springer
13 years 8 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
SAC
2010
ACM
13 years 8 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
SIGCOMM
2010
ACM
13 years 8 months ago
Stratus: energy-efficient mobile communication using cloud support
Cellular radio communication is a significant contributor to battery energy drain on smartphones, in some cases inflating the energy cost by a factor of 5 or more compared to the ...
Bhavish Agarwal, Pushkar Chitnis, Amit Dey, Kamal ...
CISS
2008
IEEE
13 years 8 months ago
Measuring interference in overcomplete signal representations
Currently, there is no quantitative way to ascertain how an overcomplete signal representation describes a signal and its features using terms drawn from a dictionary. Though spars...
Bob L. Sturm, John J. Shynk, Laurent Daudet
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
13 years 8 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi