Sciweavers

1493 search results - page 277 / 299
» Local resilience of graphs
Sort
View
CVPR
2009
IEEE
15 years 5 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
FOCS
2007
IEEE
14 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
SENSYS
2006
ACM
14 years 4 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
PDCAT
2005
Springer
14 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu