172 search results - page 7 / 35 » On the cost of searching signature trees |
ACL
1996
13 years 8 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
SODA
1993
ACM
13 years 8 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
EOR
2008
13 years 7 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
WWCA
1998
Springer
13 years 11 months ago
1998
Springer
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...