新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

meerkat library [42 articles]

最近 meerkat さんのライブラリ .
  • Trie methods for text and spatial data on secondary storage
    (1995)
    by Heping Shang
    posted to index trie by meerkat on 2007-08-24 04:13:33 as **
  • Dynamic programming matching for large scale information retrieval
    (2003), pp. 100-108.
    by Eiko Yamamoto, Masahiro Kishida, Yoshinori Takenami, Yoshiyuki Takeda, Kyoji Umemura
    posted to edit_distance by meerkat on 2007-08-24 03:53:30 as **
  • An extension of Ukkonen's enhanced dynamic programming ASM algorithm
    ACM Trans. Inf. Syst., Vol. 14, No. 1. (January 1996), pp. 94-106.
    by Hal Berghel, David Roach
    posted to dynamic_programming edit_distance by meerkat on 2007-08-24 03:49:04 as **
  • Fast text searching: allowing errors
    Commun. ACM, Vol. 35, No. 10. (October 1992), pp. 83-91.
    by Sun Wu, Udi Manber
  • Recursive hashing functions for <italic>n</italic>-grams
    ACM Trans. Inf. Syst., Vol. 15, No. 3. (July 1997), pp. 291-320.
    by Jonathan D Cohen
    posted to hashtable q-gram by meerkat on 2007-08-24 03:37:33 as **
  • Fast Approximate Search in Large Dictionaries
    Computational Linguistics, Vol. 30, No. 4., 451.
    by Stoyan Mihov, Klaus U Schulz
  • An approximate string-matching algorithm
    Theor. Comput. Sci., Vol. 92, No. 1. (January 1992), pp. 107-117.
    by Jong Y Kim, John Shawe-Taylor
    posted to approximate_string_matching edit_distance by meerkat on 2007-08-24 03:31:29 as **
  • Approximate string matching in sublinear expected time
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on (1990), pp. 116-124 vol.1.
    by WI Chang, EL Lawler
    posted to approximate_string_matching edit_distance by meerkat on 2007-08-24 03:27:53 as **
  • Improved Single and Multiple Approximate String Matching
    by Kimmo Fredriksson, Gonzalo Navarro
    posted to approximate_string_matching by meerkat on 2007-08-24 02:45:04 as **
  • An efficient approach for sequence matching in large DNA databases
    J. Inf. Sci., Vol. 32, No. 1. (February 2006), pp. 88-104.
    by Jung-Im Won, Sanghyun Park, Jee-Hee Yoon, Sang-Wook Kim
    posted to dna matching trie by meerkat on 2007-08-24 02:36:00 as **
  • Tries for Approximate String Matching
    IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 4. (August 1996), pp. 540-547.
    posted to approximate_string_matching trie by meerkat on 2007-08-24 02:26:49 as **
  • Compressed full-text indexes
    ACM Comput. Surv., Vol. 39, No. 1. (2007)
    by Gonzalo Navarro, Veli M&\#228;kinen
  • A Practical q-Gram Index for Text Retrieval Allowing Errors
    by Gonzalo Navarro, Ricardo B Yates
    posted to approximate_string_matching index q-gram by meerkat on 2007-08-23 07:27:57 as **
  • Finding highly correlated pairs efficiently with powerful pruning
    (2006), pp. 152-161.
    by Jian Zhang, Joan Feigenbaum
    posted to dedup pearson_correlation by meerkat on 2007-08-23 05:01:27 as ** along with 1 person sunandap
  • Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs
    (2004), pp. 334-343.
    by Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Kumar
    posted to dedup pearson_correlation by meerkat on 2007-08-23 05:00:09 as ** along with 1 person sunandap
  • Query-time entity resolution
    (2006), pp. 529-534.
    by Indrajit Bhattacharya, Lise Getoor, Louis Licamele
    posted to entity_resolution by meerkat on 2007-08-23 00:11:21 as **
  • Detecting Duplicates in Complex XML Data
    (2006)
    by Melanie Weis, Felix Naumann
    posted to dedup xml by meerkat on 2007-08-23 00:09:50 as **
  • Dynamic Programming
    by David B Wagner
    posted to dynamic_programming by meerkat on 2007-08-19 07:36:28 as ** along with 1 person pawelt
  • Using Branch-and-Bound with Constraint Satisfaction in Optimization Problems
    (1997)
    by S Beale
    posted to csp by meerkat on 2007-08-17 04:50:59 as ***
  • A Replacement for Voronoi Diagrams of Near Linear Size
    (2001), pp. 94-103.
    by Sariel H Peled
    posted to knn voronoi_diagram by meerkat on 2007-08-10 05:59:38 as **
  • New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
    Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings (2002), pp. 783-784.
    by Moses Charikar, Piotr Indyk, Rina Panigrahy
    posted to edit_distance partial_match by meerkat on 2007-08-10 05:58:14 as **
  • A Sublinear Algorithm for Weakly Approximating Edit Distance
    posted to approximate_string_matching edit_distance by meerkat on 2007-08-10 00:52:14 as *****
  • A tale of three spelling checkers
    Softw. Pract. Exper., Vol. 20, No. 6. (June 1990), pp. 625-630.
    by JK Mullin, DJ Margoliash
    posted to approximate_string_matching edit_distance by meerkat on 2007-08-09 07:40:36 as **
  • Distance-Sensitive Bloom Filters
    by Adam Kirsch, Michael Mitzenmacher
    posted to bloom_filter by meerkat on 2007-08-09 07:39:16 as **
  • Simple Summaries for Hashing with Multiple Choices
    by Adam Kirsch, Michael Mitzenmacher
    posted to bloom_filter by meerkat on 2007-08-09 07:38:51 as **
  • A dictionary for approximate string search and longest prefix search
    (2006), pp. 768-775.
    by Sreenivas Gollapudi, Rina Panigrahy
  • Reference reconciliation in complex information spaces
    (2005), pp. 85-96.
    by Xin Dong, Alon Halevy, Jayant Madhavan
  • A Survey of Web Information Extraction Systems
    IEEE Transactions on Knowledge and Data Engineering, Vol. 18, No. 10. (October 2006), pp. 1411-1428.
    by Mohammed Kayed, Khaled F Shaalan
  • Reconciling while tolerating disagreement in collaborative data sharing
    (2006), pp. 13-24.
    by Nicholas E Taylor, Zachary G Ives
  • Optimization techniques for string selection and comparison problems in genomics
    Engineering in Medicine and Biology Magazine, IEEE, Vol. 24, No. 3. (2005), pp. 81-87.
    by CN Meneses, CAS Oliveira, PM Pardalos
    posted to string_matching by meerkat on 2007-07-30 15:26:03 as **
  • Distinguishing string selection problems
    Information and Computation, Vol. 185, No. 1. (25 August 2003), pp. 41-55.
    by Kevin, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang
    posted to string_matching by meerkat on 2007-07-30 15:25:37 as **
  • Closest Substring Problem – Results from an Evolutionary Algorithm
    Neural Information Processing (2004), pp. 205-211.
    by Holger Mauch
    posted to string_matching by meerkat on 2007-07-30 15:17:25 as **
  • Universal Similarity
    (20 April 2005)
    by Paul Vitanyi
    posted to similarity by meerkat on 2007-07-30 15:15:54 as ** along with 1 person and 2 groups mortimer UoY-CS-AIG AI
  • On the closest string and substring problems
    Journal of the ACM, Vol. 49, No. 2. (2002), pp. 157-171.
    by Ming Li, Bin Ma, Lusheng Wang
    posted to string_matching by meerkat on 2007-07-30 15:12:51 as **
  • Faster algorithms for string matching with k mismatches
    (2000), pp. 794-803.
    by Amihood Amir, Moshe Lewenstein, Ely Porat
    posted to approx_string_matching by meerkat on 2007-07-30 14:46:53 as **
  • Understanding jokes: a neural approach to content-based information retrieval
    (1998), pp. 343-349.
    by Stephane Zrehen, Michael A Arbib
    posted to ir by meerkat on 2007-07-30 14:32:48 as ** along with 1 person and 1 group lfriedl kdl
  • Recommended reading for IR research students
    SIGIR Forum, Vol. 39, No. 2. (December 2005), pp. 3-14.
    by Alistair Moffat, Justin Zobel, David Hawking
  • Collective entity resolution in relational data
    ACM Trans. Knowl. Discov. Data, Vol. 1, No. 1. (March 2007)
    by Indrajit Bhattacharya, Lise Getoor
  • Approximate Nearest Neighbor under edit distance via product metrics
    (2004), pp. 646-650.
    by Piotr Indyk
    posted to edit_distance knn by meerkat on 2007-07-30 14:27:17 as ** along with 1 person aviad_work
  • Efficient clustering of high-dimensional data sets with application to reference matching
    (2000), pp. 169-178.
    by Andrew Mccallum, Kamal Nigam, Lyle H Ungar
  • The Web Is the Database
    (2000), pp. 91-106.
    by Jayant R Haritsa
    posted to database web by meerkat on 2007-07-30 14:23:33 as ** along with 1 person goltus
  • Simple proven approaches to text retrieval
    (1997)
    posted to ir by meerkat on 2007-07-30 14:22:54 as ** along with 2 people parmentierf macle
  • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/meerkat

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.