1046 search results - page 54 / 210 » Approximation Algorithms for Domination Search |
107
click to vote
CORR
2007
Springer
15 years 13 days ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
118
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
114
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Current web search engines return result pages containing mostly text summary even though the matched web pages may contain informative pictures. A text excerpt (i.e. snippet) is ...
SPIRE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
84
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...