199 search results - page 30 / 40 » Fast Algorithms for Computing Tree LCS |
FOCS
1993
IEEE
15 years 3 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
GD
2008
Springer
15 years 23 days ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
114
click to vote
MICCAI
2006
Springer
16 years 18 days ago
2006
Springer
This paper presents a learning based method for automatic extraction of the major cortical sulci from MRI volumes or extracted surfaces. Instead of using a few pre-defined rules su...
108
click to vote
AI
2002
Springer
14 years 11 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...