Sciweavers

4112 search results - page 31 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
15 years 1 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 2 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
PVLDB
2010
135views more  PVLDB 2010»
14 years 8 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
Jongwuk Lee, Seung-won Hwang
IFIP
2010
Springer
14 years 8 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
ICML
1998
IEEE
16 years 2 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...