1222 search results - page 152 / 245 » corr 2008 |
196
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
201
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
170
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Digital identity management intra and inter information systems, and, service oriented architectures security, are the roots of identity federation. This kind of security architec...
176
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
187
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...