109 search results - page 15 / 22 » Watermarking Graph Partitioning Solutions |
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
102
click to vote
ICDCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
138
click to vote
ECCV
2008
Springer
15 years 10 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
132
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...