4428 search results - page 188 / 886 » The Chow Parameters Problem |
115
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
138
click to vote
JGT
2010
15 years 2 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
149
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
146
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We derive a new class of photometric invariants that can be used for a variety of vision tasks including lighting invariant material segmentation, change detection and tracking, a...
173
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...