2661 search results - page 88 / 533 » Quantum Complexity Classes |
114
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
91
Voted
ISCI
2008
15 years 24 days ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
107
Voted
WG
2001
Springer
15 years 5 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
106
Voted
BMVC
2010
14 years 10 months ago
2010
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
102
Voted
NIPS
2008
15 years 2 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...