Sciweavers

2260 search results - page 359 / 452
» A new algorithm for clustering search results
Sort
View
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 1 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 1 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
DICTA
2003
15 years 1 months ago
A Robust Method for Estimating the Fundamental Matrix
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
C. L. Feng, Y. S. Hung
ICGA
1993
145views Optimization» more  ICGA 1993»
15 years 1 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ATAL
2010
Springer
15 years 1 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...