605 search results - page 60 / 121 » Parameterized Dynamic Tables |
130
Voted
CPM
1998
Springer
15 years 3 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
95
Voted
ASPLOS
2008
ACM
15 years 28 days ago
2008
ACM
Indirect jump instructions are used to implement increasinglycommon programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls...
NETWORK
2011
14 years 1 months ago
2011
Traffic monitoring is a critical network operation for the purpose of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Existing techniques for...
112
Voted
SIGMOD
2012
ACM
13 years 1 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
BTW
2007
Springer
15 years 5 months ago
2007
Springer
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...