Sciweavers

13603 search results - page 2572 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
SPAA
2006
ACM
15 years 4 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
FOCS
2005
IEEE
15 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
106
Voted
ICCV
2005
IEEE
15 years 3 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
IEEEPACT
2005
IEEE
15 years 3 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
IPPS
2005
IEEE
15 years 3 months ago
Characterizing Secure Dynamic Web Applications Scalability
Security in the access to web contents and the interaction with web sites is becoming one of the most important issues in Internet. Servers need to provide certain levels of secur...
Jordi Guitart, Vicenç Beltran, David Carrer...
« Prev « First page 2572 / 2721 Last » Next »