Sciweavers

6437 search results - page 1205 / 1288
» Parallel Algorithms for Arrangements
Sort
View
142
Voted
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 4 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
FCT
1991
Springer
15 years 4 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
103
Voted
CF
2010
ACM
15 years 4 months ago
Towards chip-on-chip neuroscience: fast mining of neuronal spike streams using graphics hardware
Computational neuroscience is being revolutionized with the advent of multi-electrode arrays that provide real-time, dynamic perspectives into brain function. Mining neuronal spik...
Yong Cao, Debprakash Patnaik, Sean P. Ponce, Jerem...
87
Voted
ASPLOS
2008
ACM
15 years 2 months ago
SoftSig: software-exposed hardware signatures for code analysis and optimization
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
James Tuck, Wonsun Ahn, Luis Ceze, Josep Torrellas
ATAL
2008
Springer
15 years 2 months ago
Robust and efficient plan recognition for dynamic multi-agent teams
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
Gita Sukthankar, Katia P. Sycara
« Prev « First page 1205 / 1288 Last » Next »