Sciweavers

2194 search results - page 49 / 439
» Improving HLRTA*( k )
Sort
View
ACSC
2006
IEEE
14 years 5 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
ICPPW
1999
IEEE
14 years 3 months ago
Improving Fairness and Privacy of Zhou-Gollmann's Fair Non-Repudiation Protocol
We deal with two claws of Zhou-Gollmann's fair nonrepudiation protocol. Firstly, their protocol divides a message into 2 parts, i.e., a key K and a ciphertext C. Then, C is d...
Kwangjo Kim, Sangjoon Park, Joonsang Baek
WADS
2005
Springer
108views Algorithms» more  WADS 2005»
14 years 4 months ago
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Nie...
ORDER
2008
61views more  ORDER 2008»
13 years 11 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
DLT
2009
13 years 8 months ago
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
Pierluigi Frisco, Oscar H. Ibarra