Sciweavers

5473 search results - page 896 / 1095
» On the graph isomorphism problem
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
CVPR
2009
IEEE
16 years 4 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
FOCS
2008
IEEE
16 years 28 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICDAR
2007
IEEE
16 years 24 days ago
Energy-Based Models in Document Recognition and Computer Vision
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
Yann LeCun, Sumit Chopra, Marc'Aurelio Ranzato, Fu...
SPAA
2005
ACM
16 years 23 hour ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner