Sciweavers

81 search results - page 10 / 17
» Even Faster Algorithm for Set Splitting!
Sort
View
IPPS
2003
IEEE
14 years 11 days ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
ATAL
2008
Springer
13 years 9 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
NETWORKS
2007
13 years 6 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
ICML
2006
IEEE
14 years 8 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
NIPS
2007
13 years 8 months ago
A Game-Theoretic Approach to Apprenticeship Learning
We study the problem of an apprentice learning to behave in an environment with an unknown reward function by observing the behavior of an expert. We follow on the work of Abbeel ...
Umar Syed, Robert E. Schapire