2137 search results - page 233 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
206
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
160
click to vote
STACS
2007
Springer
16 years 15 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
210
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
249
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
163
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...