598 search results - page 110 / 120 » A random graph model for massive graphs |
160
click to vote
FOCS
2007
IEEE
16 years 1 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
170
Voted
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
177
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
171
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a novel discriminative-generative hybrid approach in this paper, with emphasis on application in multiview object detection. Our method includes a novel generative mode...
160
click to vote
MICCAI
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...