9736 search results - page 30 / 1948 » How Fast Can We Compute Products |
166
click to vote
CSCW
2012
ACM
14 years 3 days ago
2012
ACM
A challenge for many online production communities is to direct their members to accomplish tasks that are important to the group, even when these tasks may not match individual m...
151
click to vote
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
146
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate ou...
139
click to vote
AIPS
2004
15 years 5 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
150
click to vote
MOMPES
2007
IEEE
15 years 10 months ago
2007
IEEE
The alignment of the software architecture and the functional requirements of a system is a demanding task because of the difficulty in tracing design elements to requirements. Th...