Sciweavers

2376 search results - page 4 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
RECOMB
1997
Springer
13 years 11 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
ECAI
2004
Springer
13 years 11 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
13 years 11 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg
DCOSS
2010
Springer
13 years 10 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos
ICOIN
2004
Springer
14 years 26 days ago
Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively rein...
Jae Seuk Oh, Sung-il Bae, Jin-Ho Ahn, Sungho Kang