4949 search results - page 181 / 990 » Consistency and Set Intersection |
142
click to vote
ENDM
2008
15 years 5 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
123
Voted
JCT
2008
15 years 4 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
141
Voted
PR
2006
15 years 4 months ago
2006
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
142
click to vote
AUTOMATICA
2004
15 years 4 months ago
2004
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
167
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
Because of the large amount of trajectory data produced by mobile devices, there is an increasing need for mechanisms to extract knowledge from this data. Most existing works have...