Sciweavers

1110 search results - page 14 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
89
Voted
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 3 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
97
Voted
TON
2012
13 years 1 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
CIARP
2004
Springer
15 years 3 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
GCC
2003
Springer
15 years 4 months ago
Preserving Data Consistency in Grid Databases with Multiple Transactions
High performance Grid computing provides an infrastructure for access and processing of large volume, terabyte or even petabytes, of distributed data. Research in data grid has foc...
Sushant Goel, Hema Sharda, David Taniar
IPPS
2009
IEEE
15 years 6 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...