Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
I
Jakobsson M, Elaine Shi, Golle P, Chow R.  2009.  Implicit authentication for mobile devices. :9-9.
Elaine Shi, Niu Y, Jakobsson M, Chow R.  2011.  Implicit Authentication through Learning User Behavior. Information Security. 6531:99-113.
King D, Hicks B, Hicks MW, Jaeger T.  2008.  Implicit Flows: Can’t Live with ‘Em, Can’t Live without ‘Em. Information Systems SecurityInformation Systems Security. 5352:56-70.
Olsen MB, Resnik P.  1997.  Implicit object constructions and the (in) transitivity continuum. 33rd Proceedings of the Chicago Linguistic Society. :327-336.
Park S, O’Leary DP.  2011.  Implicitly-weighted total least squares. Linear Algebra and its Applications. 435(3):560-577.
Souza CP, Almeida BC, Colwell RR, Rivera ING.  2011.  The Importance of Chitin in the Marine Environment. Marine Biotechnology. :1-8.
Arya S, Malamatos T, Mount D.  2006.  On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
Daumé H, Knight K, Langkilde-Geary I, Marcu D, Yamada K.  2002.  The importance of lexicalized syntax models for natural language generation tasks. Proc. of INLG. :9-16.
Giraud-Carrier C, Dunham MH, Atreya A, Elkan C, Perlich C, Swirszcz G, Shi X, Philip SY, Fürnkranz J, Sima JF.  2010.  On the importance of sharing negative results. SIGKDD explorations. 12(2):3-4.
Samet H, Brabec F, Sankaranarayanan J.  2004.  Importing abstract spatial data into the SAND database system. Proceedings of the 2004 annual national conference on Digital government research. :62:1–62:2-62:1–62:2.
Katz J, Schröder D, Yerukhimovich A.  2011.  Impossibility of blind signatures from one-way permutations. Theory of Cryptography. :615-629.
Hollingsworth J, Maneewongvatana S.  1999.  Imprecise Calendars: an Approach to Scheduling Computational Grids. Distributed Computing Systems, International Conference on. :0352-0352.
Srinivasan A.  2008.  Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
Khuller S, Kim YA, Malekian A.  2006.  Improved algorithms for data migration. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :164-175.
Mount D, Netanyahu NS, LeMoigne J.  1998.  Improved algorithms for robust point pattern matching and applications to image registration. Proceedings of the fourteenth annual symposium on Computational geometry. :155-164.
Chari S, Rohatgi P, Srinivasan A.  2000.  Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1):81-107.
Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A.  2006.  An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
Archer A, Bateni MH, Hajiaghayi MT, Karloff H.  2009.  Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.
Halperin E, Srinivasan A.  2002.  Improved Approximation Algorithms for the Partial Vertex Cover Problem. Approximation Algorithms for Combinatorial OptimizationApproximation Algorithms for Combinatorial Optimization. 2462:161-174.
Khuller S, Raghavachari B.  1995.  Improved approximation algorithms for uniform connectivity problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :1-10.
Cho M, Mount D.  2005.  Improved approximation bounds for planar point pattern matching. Algorithms and Data Structures. :432-443.
Cho M, Mount D.  2008.  Improved approximation bounds for planar point pattern matching. Algorithmica. 50(2):175-207.
Srinivasan A.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
Srinivasan A.  1995.  Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
Gupta A, Srinivasan A.  2003.  An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing. 2:53-64.

Pages