Sciweavers

380 search results - page 36 / 76
» A Categorical Setting for Lower Complexity
Sort
View
80
Voted
ALT
2006
Springer
15 years 6 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
104
Voted
JMLR
2008
148views more  JMLR 2008»
14 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 9 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
ICIP
2002
IEEE
15 years 11 months ago
Recognizing specific texture patterns by integration of multiple texture methods
A supervised pixel-based classifier for identifying the presence of a given set of texture patterns of interest in a complex textured image is described. The proposed technique in...
Domènec Puig, Miguel Angel García
FOCS
2009
IEEE
15 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...