Sciweavers

2200 search results - page 54 / 440
» Bloch's Constant is Computable
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan
SCVMA
2004
Springer
15 years 3 months ago
On the Relationship Between Image and Motion Segmentation
Abstract. In this paper we present a generative model for image sequences, which can be applied to motion segmentation and tracking, and to image sequence compression. The model co...
Adrian Barbu, Song Chun Zhu
WSC
2007
15 years 7 days ago
Path-sampling for state-dependent importance sampling
State-dependent importance sampling (SDIS) has proved to be particularly useful in simulation (specially in rare event analysis of stochastic systems). One approach for designing ...
Jose H. Blanchet, Jingchen Liu
MP
1998
83views more  MP 1998»
14 years 9 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
ICDCN
2011
Springer
14 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...