Sciweavers

874 search results - page 20 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
IPL
2006
67views more  IPL 2006»
13 years 7 months ago
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
Peter Damaschke
ICCV
2011
IEEE
12 years 7 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 1 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
EPEW
2005
Springer
14 years 1 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....