1449 search results - page 99 / 290 » Self-Randomized Exponentiation Algorithms |
181
click to vote
CASES
2004
ACM
15 years 10 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
193
Voted
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In many computer vision algorithms, the well known Euclidean or SSD (sum of the squared differences) metric is prevalent and justified from a maximum likelihood perspective when t...
157
Voted
AAAI
2007
15 years 8 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
169
click to vote
AIPS
2007
15 years 8 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
140
Voted
AAAI
2010
15 years 7 months ago
2010
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...