14699 search results - page 2630 / 2940 » Complexity and Cognitive Computing |
157
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
133
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
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...
126
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
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...
174
Voted
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
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...
157
click to vote
IEEEPACT
2005
IEEE
15 years 10 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...