Sciweavers

10054 search results - page 212 / 2011
» On the Complexity of Function Learning
Sort
View
DAGSTUHL
2007
15 years 2 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
108
Voted
NAR
2011
252views Computer Vision» more  NAR 2011»
14 years 3 months ago
BISC: Binary SubComplexes in proteins database
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
Thomas Juettemann, Dietlind L. Gerloff
94
Voted
FLAIRS
2001
15 years 2 months ago
User-Agent Interactions in Mixed-Initiative Learning
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
Dorin Marcu, Mihai Boicu, Gheorghe Tecuci
100
Voted
ICML
2006
IEEE
16 years 1 months ago
Ranking on graph data
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
Shivani Agarwal
DICTA
2007
15 years 2 months ago
Fuzzy Model Based Recognition of Handwritten Hindi Characters
This paper presents the recognition of handwritten Hindi Characters based on the modified exponential membership function fitted to the fuzzy sets derived from features consisting...
Madasu Hanmandlu, O. V. Ramana Murthy, Vamsi Krish...