2843 search results - page 170 / 569 » On Efficient Spatial Matching |
141
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
138
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
We present an equation-based transistor size optimizer that minimizes delay of custom circuits. Our method uses static timing analysis to find the critical paths and numerical met...
117
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
111
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In the past years Dynamic Voltage and Frequency Scaling (DVFS) has been an effective technique that allowed microprocessors to match a predefined power budget. However, as process...
250
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...