Sciweavers

2194 search results - page 112 / 439
» Improving HLRTA*( k )
Sort
View
FCT
1993
Springer
15 years 5 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
COMPGEOM
2001
ACM
15 years 5 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ASPLOS
2008
ACM
15 years 3 months ago
How low can you go?: recommendations for hardware-supported minimal TCB code execution
We explore the extent to which newly available CPU-based security technology can reduce the Trusted Computing Base (TCB) for security-sensitive applications. We find that although...
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Mi...
CONEXT
2008
ACM
15 years 3 months ago
Uplink allocation beyond choke/unchoke: or how to divide and conquer best
Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the ratebased choke/unchoke algorithm of BitTorrent which was develop...
Nikolaos Laoutaris, Damiano Carra, Pietro Michiard...
FPLAY
2008
15 years 3 months ago
Lessons from Brain Age on password memorability
User authentication involves establishing a user's right to access a system. Most user authentication is done with text passwords, which have advantages over other approaches...
Alain Forget, Sonia Chiasson, Robert Biddle