Sciweavers

3082 search results - page 85 / 617
» New Bounds for the Controller Problem
Sort
View
131
Voted
CVPR
2007
IEEE
16 years 6 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
144
Voted
RECOMB
2005
Springer
16 years 4 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
FOCS
2003
IEEE
15 years 9 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
RTSS
2005
IEEE
15 years 9 months ago
Load Balancing in Bounded-Latency Content Distribution
In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications...
Chengdu Huang, Gang Zhou, Tarek F. Abdelzaher, San...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 1 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu