109 search results - page 16 / 22 » Large independent sets in regular graphs of large girth |
153
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
108
Voted
DSD
2010
IEEE
15 years 2 months ago
2010
IEEE
—The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable des...
140
Voted
AI
2006
Springer
15 years 1 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
95
Voted
CORR
2010
Springer
15 years 11 days ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
127
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...