Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
Reputation mechanisms for detecting and punishing free-riders in ad hoc networks depend on the local detection of selfish behavior. Although naive selfish strategies based on drop...
Bo Wang 0001, Sohraab Soltani, Jonathan K. Shapiro...
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 s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...