{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:04Z","timestamp":1759847704028},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,10,23]],"date-time":"2008-10-23T00:00:00Z","timestamp":1224720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10489-008-0147-6","type":"journal-article","created":{"date-parts":[[2008,10,22]],"date-time":"2008-10-22T08:00:28Z","timestamp":1224662428000},"page":"311-329","source":"Crossref","is-referenced-by-count":19,"title":["Fast exact feature based data correspondence search with\u00a0an\u00a0efficient bit-parallel MCP solver"],"prefix":"10.1007","volume":"32","author":[{"given":"Pablo","family":"San\u00a0Segundo","sequence":"first","affiliation":[]},{"given":"Diego","family":"Rodr\u00edguez-Losada","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Mat\u00eda","sequence":"additional","affiliation":[]},{"given":"Ram\u00f3n","family":"Gal\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,23]]},"reference":[{"key":"147_CR1","first-page":"126","volume-title":"Pattern recognition and applications","author":"S Dominguez","year":"2000","unstructured":"Dominguez S, Campoy P, Baeza C (2000) On automated trademark search techniques. In: Pattern recognition and applications. IOS Press, Amsterdam, pp\u00a0126\u2013133"},{"key":"147_CR2","unstructured":"Hogg DW, Blanton M, Lang D, Mierle K, Roweis S (2008) Automated astrometry. In: Argyle RW, Bunclark PS, Lewis JR (eds) Astronimical data analysis software and systems\u00a0XVII. ASP conference series, vol\u00a0394, pp\u00a027\u201334"},{"key":"147_CR3","volume-title":"Computer vision","author":"DH Ballard","year":"1982","unstructured":"Ballard DH, Brown M (1982) Computer vision. Prentice-Hall, New York"},{"issue":"2","key":"147_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/70.563647","volume":"13","author":"M Betke","year":"1997","unstructured":"Betke M, Gurvits L (1997) Mobile robot localization using landmarks. IEEE Trans Robot Autom 13(2):251\u2013263","journal-title":"IEEE Trans Robot Autom"},{"key":"147_CR5","doi-asserted-by":"crossref","unstructured":"Neira J, Tard\u00f3s JD, Castellanos JA (2003) Linear time vehicle relocation in SLAM. In: IEEE int conf robotics and automation, Taipei, Taiwan, May 2003","DOI":"10.1109\/ROBOT.2003.1241632"},{"key":"147_CR6","doi-asserted-by":"crossref","unstructured":"Paz LM, Pin\u00edes P, Neira J, Tard\u00f3s JD (2005) Global localization in SLAM in bilinear time. In: IEE\/RSJ int conf on intelligent robots and systems, Edmonton, Canada, 2\u20136 August 2005","DOI":"10.1109\/IROS.2005.1545055"},{"key":"147_CR7","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a\u00a0guide to the theory of NP-completeness. Freeman, New York"},{"issue":"2","key":"147_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-8655(99)00143-9","volume":"21","author":"H Bunke","year":"2000","unstructured":"Bunke H, Kandel A (2000) Mean and maximum common subgraph of two graphs. Pattern Recogn Lett 21(2):163\u2013168","journal-title":"Pattern Recogn Lett"},{"key":"147_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization, supplement vol\u00a0A","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) Handbook of combinatorial optimization, supplement vol\u00a0A. Kluwer Academic, Dordrecht, pp\u00a01\u201374"},{"key":"147_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2006","unstructured":"Tomita E, Kameda T (2006) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J\u00a0Glob Optim 37:95\u2013111","journal-title":"J\u00a0Glob Optim"},{"key":"147_CR11","doi-asserted-by":"crossref","unstructured":"San Segundo P, Gal\u00e1n R, Rodr\u00edguez-Losada D (2006) Efficient search using bitboard models. In: Proceedings XVIII int joint conf on tools with AI (ICTAI\u201906), pp\u00a0132\u2013138","DOI":"10.1109\/ICTAI.2006.53"},{"key":"147_CR12","doi-asserted-by":"crossref","unstructured":"San Segundo P, Rodriguez-Losada D, Gal\u00e1n R, Mat\u00eda F, Jim\u00e9nez A (2007) Exploiting CPU bit parallel operations to improve efficiency in search. In: Proceedings XIX int joint conf on tools with AI (ICTAI\u201907), Greece, pp\u00a053\u201359","DOI":"10.1109\/ICTAI.2007.40"},{"key":"147_CR13","unstructured":"San Segundo P, Gal\u00e1n R (2005) Bitboards, a new approach. In: Proceedings artificial intelligence and applications, AIA-2005, IASTED, Austria, pp\u00a0394\u2013399"},{"issue":"3","key":"147_CR14","first-page":"166","volume":"20","author":"EA Heinz","year":"1997","unstructured":"Heinz EA (1997) How DarkThought plays chess. ICCA\u00a0J 20(3):166\u2013176","journal-title":"ICCA\u00a0J"},{"key":"147_CR15","unstructured":"Ambler AP, Barrow HG, Brown CM, Burstall RM, Popplesotne RJ (1973) A versatile computer-controlled assembly system. In: Proc III int joint conf on art intelligence, pp\u00a0298\u2013307"},{"key":"147_CR16","volume-title":"Hacker\u2019s delight","author":"HS Warren Jr","year":"2002","unstructured":"Warren HS Jr (2002) Hacker\u2019s delight. Addison-Wesley, Reading"},{"key":"147_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J (1994) The maximum clique problem. J\u00a0Glob Optim 4:301\u2013328","journal-title":"J\u00a0Glob Optim"},{"issue":"5","key":"147_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"PM Pardalos","year":"1992","unstructured":"Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19(5):363\u2013375","journal-title":"Comput Oper Res"},{"key":"147_CR19","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"issue":"7","key":"147_CR20","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.robot.2006.04.003","volume":"54","author":"D Rodriguez-Losada","year":"2006","unstructured":"Rodriguez-Losada D, Matia F, Galan R (2006) Building geometric feature based maps for indoor service robots. Robot Auton Syst 54(7):546\u2013558","journal-title":"Robot Auton Syst"},{"key":"147_CR21","doi-asserted-by":"crossref","unstructured":"Rosten E, Drummond T (2005) Fusing points and lines for high performance tracking. In: IEEE international conference on computer vision, vol\u00a02, Oct 2005, pp\u00a01508\u20131511","DOI":"10.1109\/ICCV.2005.104"},{"key":"147_CR22","doi-asserted-by":"crossref","unstructured":"Rosten E, Drummond T (2006) Machine learning for high-speed corner detection. In: European conference on computer vision","DOI":"10.1007\/11744023_34"},{"key":"147_CR23","volume-title":"Exploring artificial intelligence in the new millennium","author":"S Thrun","year":"2002","unstructured":"Thrun S (2002) Robotic mapping: a survey. In: Lakemeyer G, Nebel B (eds) Exploring artificial intelligence in the new millennium. Morgan Kaufmann, San Mateo"},{"issue":"5","key":"147_CR24","first-page":"291","volume":"23","author":"D Rodriguez-Losada","year":"2006","unstructured":"Rodriguez-Losada D, Matia F, Jimenez A, Galan R (2006) Local map fusion for real-time indoor simultaneous localization and mapping. J\u00a0Field Robot 23(5):291\u2013309","journal-title":"J\u00a0Field Robot"},{"issue":"4","key":"147_CR25","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10846-007-9171-8","volume":"50","author":"D Rodriguez-Losada","year":"2007","unstructured":"Rodriguez-Losada D, Matia F, Pedraza L, Jimenez A, Galan R (2007) Consistency of SLAM-EKF algorithms for indoor environments. J\u00a0Intell Robot Syst 50(4):375\u2013397","journal-title":"J\u00a0Intell Robot Syst"},{"key":"147_CR26","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/70.976019","volume":"176","author":"J Neira","year":"2001","unstructured":"Neira J, Tardos JD (2001) Data association in stochastic mapping using the joint compatibility test. IEEE Trans Robot Autom 176:890\u2013897","journal-title":"IEEE Trans Robot Autom"},{"key":"147_CR27","unstructured":"Bailey T (2002) Mobile robot localisation and mapping in extensive outdoor environments. PhD thesis, Australian Centre for Field Robotics, University of Sydney"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0147-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0147-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0147-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:42Z","timestamp":1559139942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0147-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,23]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0147-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,23]]}}}