1629 search results - page 135 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
125
click to vote
JPDC
2006
14 years 10 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
FLAIRS
2010
15 years 12 days ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
102
Voted
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
ICCV
2003
IEEE
16 years 13 hour ago
2003
IEEE
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
74
Voted
ATAL
2009
Springer
14 years 11 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...