{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:01Z","timestamp":1725583981897},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_15","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"130-141","source":"Crossref","is-referenced-by-count":2,"title":["Expected Computations on Color Spanning Sets"],"prefix":"10.1007","author":[{"given":"Chenglin","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farong","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristan, V.: The farthest color Voronoi diagram and related problems. In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG 2001), pp. 113\u2013116 (2001)"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MPRV.2003.1186725","volume":"2","author":"A.R. Beresford","year":"2003","unstructured":"Beresford, A.R., Stajano, F.: Location privacy in pervasive computing. IEEE Pervasive Computing\u00a02(1), 46\u201355 (2003)","journal-title":"IEEE Pervasive Computing"},{"issue":"9","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TKDE.2004.46","volume":"16","author":"R. Cheng","year":"2004","unstructured":"Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Querying imprecise data in moving object environments, knowledge and data engineering. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1112\u20131127 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/11957454_23","volume-title":"Privacy Enhancing Technologies","author":"R. Cheng","year":"2006","unstructured":"Cheng, R., Zhang, Y., Bertino, E., Prabhakar, S.: Preserving user location privacy in mobile data management infrastructures. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 393\u2013412. Springer, Heidelberg (2006)"},{"issue":"5","key":"15_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0218195909003076","volume":"19","author":"S. Das","year":"2009","unstructured":"Das, S., Goswani, P.P., Nandy, S.C.: Smallest color-spanning object revised. International Journal of Computational Geometry and Applications\u00a019(5), 457\u2013478 (2009)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14553-7_27","volume-title":"Frontiers in Algorithmics","author":"R. Fleischer","year":"2010","unstructured":"Fleischer, R., Xu, X.: Computing Minimum Diameter Color-Spanning Sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 285\u2013292. Springer, Heidelberg (2010)"},{"key":"15_CR7","unstructured":"Gedik, B., Liu, L.: A customizable k-anonymity model for protecting location privacy. In: Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), pp. 620\u2013629 (2005)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-48482-5_9","volume-title":"Advances in Spatial Databases","author":"D. Pfoser","year":"1999","unstructured":"Pfoser, D., Jensen, C.S.: Capturing the uncertainty of moving-object representations. In: G\u00fcting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol.\u00a01651, pp. 111\u2013131. Springer, Heidelberg (1999)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/BFb0053708","volume-title":"Temporal Databases: Research and Practice","author":"A.P. Sistla","year":"1998","unstructured":"Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.K.: Querying the uncertain position of moving objects. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Dagstuhl Seminar 1997. LNCS, vol.\u00a01399, pp. 310\u2013337. Springer, Heidelberg (1998)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: Towards searching by document. In: Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE 2009), pp. 688\u2013699 (2009)","DOI":"10.1109\/ICDE.2009.77"},{"key":"15_CR11","unstructured":"Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic Skylines on Uncertain Data. In: VLDB 2007, pp. 15\u201326 (2007)"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TKDE.2009.108","volume":"22","author":"M.A. Cheema","year":"2010","unstructured":"Cheema, M.A., Lin, X., Wang, W., Zhang, W., Pei, J.: Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data. IEEE Trans. Knowl. Data Eng.\u00a022(4), 550\u2013564 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1109\/TKDE.2009.137","volume":"22","author":"S.M. Yuen","year":"2010","unstructured":"Yuen, S.M., Tao, Y., Xiao, X., Pei, J., Zhang, D.: Superseding Nearest Neighbor Search on Uncertain Spatial Databases. IEEE Trans. Knowl. Data Eng.\u00a022(7), 1041\u20131055 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N. Dalvi","year":"2007","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J.\u00a016(4), 523\u2013544 (2007)","journal-title":"VLDB J."},{"issue":"8","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1109\/TKDE.2010.66","volume":"22","author":"G. Cormode","year":"2010","unstructured":"Cormode, G., Garofalakis, M.: Histograms and Wavelets on Probabilistic Data. IEEE Trans. on Knowl. and Data Eng.\u00a022(8), 1142\u20131157 (2010)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 191\u2013200 (2008)","DOI":"10.1145\/1376916.1376944"},{"key":"15_CR17","unstructured":"Tao, Y., Cheng, R., Xiao, X., Ngai, W.-K., Kao, B., Prabhakar, S.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 922\u2013933 (2005)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11785293_35","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M. L\u00f6ffler","year":"2006","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest tours and convex hulls for imprecise points. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 375\u2013387. Springer, Heidelberg (2006)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-22300-6_45","volume-title":"Algorithms and Data Structures","author":"A. J\u00f8rgensen","year":"2011","unstructured":"J\u00f8rgensen, A., L\u00f6ffler, M., Phillips, J.M.: Geometric computations on indecisive points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 536\u2013547. Springer, Heidelberg (2011)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ju, W., Fan, C., Luo, J., Zhu, B., Daescu, O.: On Some Geometric Problems of Color-Spanning Sets. Journal of Combinatorial Optimization (2012), doi:10.1007\/s10878-012-9458-y","DOI":"10.1007\/s10878-012-9458-y"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Goodman, J., O\u2019Rourke, J.: Handbook of discrete and computational geometry. Chapman & Hall\/CRC (2004)","DOI":"10.1201\/9781420035315"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Afshani, P., Agarwal, P.K., Arge, L., Larsen, K.G., Phillips, J.M.: (Approximate) uncertain skylines. In: Proceedings of the 14th International Conference on Database Theory, pp. 186\u2013196 (2011)","DOI":"10.1145\/1938551.1938576"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Stochastic minimum spanning trees in Euclidean spaces. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry, pp. 65\u201374 (2011)","DOI":"10.1145\/1998196.1998206"},{"issue":"4","key":"15_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2344422.2344433","volume":"8","author":"P.K. Agarwal","year":"2012","unstructured":"Agarwal, P.K., Cheng, S.W., Yi, K.: Range searching on uncertain data. ACM Transactions on Algorithms\u00a08(4), 43 (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Efrat, A., Sankararaman, S., Zhang, W.: Nearest-neighbor searching under uncertainty. In: Proceedings of the 31st Symposium on Principles of Database Systems, pp. 225\u2013236 (2012)","DOI":"10.1145\/2213556.2213588"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:08:12Z","timestamp":1557702492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}