139 search results - page 8 / 28 » Sparse Projections over Graph |
102
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
68
Voted
AGILEDC
2004
IEEE
15 years 3 months ago
2004
IEEE
To maximize the velocity of business value delivery, Alistair Cockburn talks of having a process that is "barely sufficient." At Landmark Graphics we developed some guid...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
126
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...