20441 search results - page 416 / 4089 » Locally Computable Structures |
257
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
200
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
171
click to vote
COLING
2010
15 years 1 months ago
2010
Unlike static documents, version controlled documents are continuously edited by one or more authors. Such collaborative revision process makes traditional modeling and visualizat...
192
click to vote
EJC
2008
15 years 6 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
187
click to vote
ICN
2005
Springer
16 years 5 days ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...