Publications

Found 416 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title is C  [Clear All Filters]
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
Iyer, R., Jegelka S., & Bilmes J. A. (2013).  Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions.
J
Jacobsen, H-A., & Voisard A. (1998).  CORBA-Based Interoperable Geographic Information Systems.
[Anonymous] (1999).  Connectionist Symbol Processing: Dead or Alive?. (Jagota, A.., Plate T.., Shastri L., & Sun R.., Ed.).2, 1-40.
Jamin, S., Shenker S. J., & Danzig P. B. (1997).  Comparison of Measurement-Based Admission Control Algorithms for Controlled-Load Service. Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 3, 973-980.
Janin, A., Friedland G., & Sommer R. (2012).  Content?based Privacy for Consumer?Produced Multimedia.
Janoch, A., Karayev S., Jia Y., Barron J. T., Fritz M., Saenko K., et al. (2011).  A Category-Level 3-D Object Dataset: Putting the Kinect to Work. 1168-1174.
Jia, Y., Shelhamer E., Donahue J., Karayev S., Long J., Girshick R., et al. (2014).  Caffe: Convolutional Architecture for Fast Feature Embedding. 675-678.
Jia, Y., & Han M. (2013).  Category Independent Object-Level Saliency Detection.
Jia, Y., Vinyals O., & Darrell T. (2013).  On Compact Codes for Spatially Pooled Features.
Jurafsky, D. (1993).  A Cognitive Model of Sentence Interpretation: the Construction Grammar Approach.
K
Kääriäinen, M., & Langford J. (2005).  A Comparison of Tight Generalization Error Bounds. Proceedings of the 22nd International Conference on Machine Learning (ICML 2005). 409-416.
Kadanoff, L. P., & Shenker S. J. (1982).  Critical Behavior of a KAM Surface: I. Empirical Results. Journal of Physical Statistics. 27(4), 631-656.
Kannan, J. Kumar, Caesar M., Stoica I., & Shenker S. J. (2007).  On the Consistency of DHT-Based Routing.
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Karpinski, M., Larmore L. L., & Rytter W. (1996).  Correctness of Constructing Optimal Alphabetic Trees Revisited.

Pages