Sciweavers

4377 search results - page 493 / 876
» Mass problems and randomness
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
CVPR
2010
IEEE
16 years 3 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
CVPR
2010
IEEE
16 years 3 months ago
PROST: Parallel Robust Online Simple Tracking
Tracking-by-detection is increasingly popular in order to tackle the visual tracking problem. Existing adaptive methods suffer from the drifting problem, since they rely on selfup...
Jakob Santner, Christian Leistner, Amir Saffari, T...
INFOCOM
2009
IEEE
16 years 1 months ago
Virtual Network Embedding with Coordinated Node and Link Mapping
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Ra...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...