Publication Search Results

Title	Author	Bibliographic	Date	Group	Links
On the power of randomization in online algorithms	S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson	Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pp. 379-86	May 1990	Algorithms
On the power of randomization in on-line algorithms	S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson	Algorithmica, Vol. 11, No. 1, pp. 2-14	January 1994	Algorithms
On the Power and Limits of Evolutionary Conservation -- Unraveling Bacterial Gene Regulatory Networks	J. Baumbach	Nucleic Acids Research, Vol. 38, No. 22, pp. 7877-7884	December 2010	Algorithms	[PDF]
On the Optimality of Huffman Trees	R. M. Karp and C.R. Glassey	SIAM Journal on Applied Mathematics, Vol. 31, No. 2, pp. 368-78	September 1976	Algorithms
On the Optimality of Huffman Trees	R. M. Karp and C.R. Glassey	Report number ORC-74-21, University of California, Berkeley, California	June 1974	Algorithms
On the Inference of Ancestries in Admixed Populations	S. Sankararaman, G. Kimmel, E. Halperin and M. I. Jordan	Genome Research, Vol 18, Issue 4, pp. 668-675	April 2008	Algorithms	[PDF]
On the Effects of Adding Objectives to Plateau Functions	D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler	IEEE Transactions on Evolutionary Computation, Vol. 13, Issue 3, pp. 591-603	June 2009	Algorithms	[PDF]
On the Computational Complexity of Combinatorial Problems	R. M. Karp	Networks, Vol. 5, No.1. Also in the Proceedings of the Symposium on Large-Scale Networks, Evanston, Illinois, pp. 45-68, April 1974	January 1975	Algorithms
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas	P. Beame, R.M. Karp, T. Pitassi, and M. Saks	Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71.	May 1998	Algorithms
On the Complexity of Haplotyping via Perfect Phylogeny	J. Gramm, T. Nierhoff, R. Sharan, and T. Tantau	Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, pp. 35-46	January 05 2004	Algorithms
On Parallel Evaluation of Game Trees	R.M. Karp and Y. Zhang	Journal of the ACM, Nov. 1998, vol.45, (no.6):1050-75.	1998	Algorithms
On parallel evaluation of game trees	R. M. Karp and Y. Zhang	Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89), Santa Fe, New Mexico, pp. 409-20	June 1989	Algorithms
On Mixing and Edge Expansion Properties in Randomized Broadcasting	T. Sauerwald	Algorithmica, Vol. 56, No. 1, pp. 51-88	January 2010	Algorithms
On linear characterizations of combinatorial optimization problems	R. M. Karp, C.H. Papadimitriou	SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32	November 1982	Algorithms
On Linear Characterizations of Combinatorial Optimization Problems	R. M. Karp and C.H. Papadimitriou	Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, New York, pp. 1-9	October 1980	Algorithms
On Approximating Optimal Auctions	A. Ronen	The Third ACM Conference on Electronic Commerce (EC01), 11-17, 2001.	2001	Algorithms
On Active Learning in the Non-Realizable Case	M. Kaariainen	Proceedings of the Foundations of Active Learning Workshop at the 19th Annual Conference on Neural Information Processing Systems (NIPS), Vancouver, Canada	December 2005	Algorithms
On a search problem related to branch-and-bound procedures	R. M. Karp, M. Saks, and A. Wigderson	Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), Toronto, Ontario, Canada. Also in IEEE Computer Society Press, Washington D.C., pp.19-28	October 1986	Algorithms
Novel Associations for Coronary Artery Disease Derived from Genome Wide Association Studies Are Not Associated with Increased Carotid Intima-Media Thickness....	L. Conde, S. Bevan, M. Sitzer, N. Klopp, T. Illig, J. Thiery, J. Seissler, J. Baumert, O. Raitakari, M. Khnen, L. P. Lyytikinen, R. Laaksonen, J. Viikari, T. Lehtimki, W. Koernig, E. Halperin, H. S. Markus	Atherosclerosis, Vol. 219, No 2, pp. 684-689	December 2011	Algorithms
Note on Learning Rate Schedules for Stochastic Optimization	C. Darken and J. Moody	Advances in Neural Information Processing Systems, Vol. 3, Lippmann, Moody, and Touretzky, eds. Morgan Kaufmann, Palo Alto	1991	Algorithms
Note on Generalization, Regularization, and Architecture Selection in Nonlinear Learning Systems	J. Moody	Proceedings of the First IEEE-SP Workshop on Neural Networks for Signal Processing, pp. 1-10	1991	Algorithms
Note on Development of Modularity in Simple Cortical Models	A. Chernjavsky and J. Moody	Advances in Neural Information Processing Systems, Vol. 2, D. Touretzky, ed., Morgan Kaufmann, Palo Alto	1990	Algorithms
Noisy Binary Search	R. M. Karp and R. Kleinberg	Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, pp. 881-890	January 2007	Algorithms
New Approaches to Enterprise Cooperation Generation and Management	J. Laessig and U. Trommler	Proceedings of the 12th International Conference on Enterprise Information Systems (ICEIS 2010), Funchal, Portugal	June 2010	Algorithms
Neural Networks for Time Series Analysis	Y Liao, J. Moody, and L. Wu	Handbook on Neural Network Signal Processing, edited by Y-H Hu and J-N Hwang, CRC Press 2001.	2002	Algorithms
Neural Network Modeling of Physiological Processes	V. Tresp, J. Moody, and W.R. Delong	Computational Learning Theory and Natural Learning Systems, Vol. 2, T. Petsche, M. Kearns, S. Hanson, R. Rivest (eds), MIT Press, pp. 363-378	1993	Algorithms
Networks with Learned Unit Response Functions	J. Moody and N. Yarvin	Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto, pp. 1048-1055	1992	Algorithms
Nearly Optimal Competitive Online Replacement Policies	R. El-Yaniv and R.M. Karp	Mathematics of Operations Research, Nov. 1997, vol.22, (no.4):814-39.	1997	Algorithms
Near-Perfect Load Balancing by Randomized Rounding	T. Friedrich and T. Sauerwald	Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130	May 2009	Algorithms	[PDF]
Near-optimal Solutions to a 2-dimensional Placement Problem	R. M. Karp, A.C. McKellar, and C.K. Wong	SIAM Journal on Computing, Vol. 4, No. 3, pp. 271-86	September 1975	Algorithms
Multiplicative Approximations and the Hypervolume Indicator	T. Friedrich, C. Horoba, and F. Neumann	Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009), Montreal, Canada, pp. 571-578	July 2009	Algorithms	[PDF]
Multiplexing Schemes for Generic SNP Genotyping Assays	R. Sharan, A. Ben-Dor, and Z. Yakhini	Proceedings of PSB'04, pp. 140-151	January 05 2004	Algorithms
Multiple Sequence Alighment with Arbitrary Gap Costs: Computing an Optimal Solution Using Polydhedral Combinatorics	E. Althaus, A. Caprara, H.P. Lenhof, and K. Reinert	ECCB, 4-16, 2002.	2002	Algorithms
Multi-Effect Decompositions for Financial Data Modeling	L. Wu and J. Moody	Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997.	1997	Algorithms
MotifPrototyper: A Bayesian Profile Model for Motif Families	E.P. Xing and R.M. Karp	Proceedings of the National Academy of Sciences of the United States of America, Vol. 101, No. 29, pp. 10523-10528. DOI:10.1073/pnas.0403564101.	July 2004	Algorithms	[PDF]
MotifAdjuster: A Tool for Computational Reassessment of Transcription Factor Binding Site Annotations	J. Keilwagen, J. Baumbach, T. Kohl, and I. Grosse	Genome Biology, Vol. 10, Issue 5, p. R46	May 2009	Algorithms	[PDF]
Monte-Carlo approximation algorithms for enumeration problems	R. M. Karp, M. Luby, and N. Madras	Journal of Algorithms, Vol. 10, No.3, pp. 429-48	September 1989	Algorithms
Monte-Carlo algorithms for the planar multiterminal network reliability problem	R. M. Karp and M. Luby	Journal of Complexity, Vol. 1, No. 1. Also in the Proceedings of the Symposium on the Complexity of Approximately Solved Problems, New York, New York, pp. 45-64, April 1985	October 1985	Algorithms
Modeling parallel communication	R. M. Karp	Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95), Santa Barbara, California, p. 2	April 1995	Algorithms
miRNAkey: A Software for microRNA Deep Sequencing Analysis	R. Ronen, I. Gan, S. Modai, A. Sukacheov, G. Dror, E. Halperin, and N. Shomron	Bioinformatics, Vol. 26, Issue 20, pp. 2615-2616	October 2010	Algorithms
Minimizing Downside Risk via Stochastic Dynamic Programming	J. Moody and M. Saffell	Computational Finance 1999, edited by Y. S. Abu-Mostafa, B. LeBaron, A. W. Lo, and A. S. Weigend, MIT Press, Cambridge, MA, 2000.	2000	Algorithms
MGMR: Leveraging RNA-Seq Population Data to Optimize Expression Estimation	R. Rozov, E. Halperin, and R. Shamir	Proceedings of the Second Annual Satellite Workshop on Massively Parallel Sequencing at the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain. Published in BMC Bioinformatics, Vol. 13, Suppl. 6:S2	April 2012	Algorithms	[PDF]
Maximum matchings in sparse random graphs	R. M. Karp and M. Sipser	Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, pp. 364-75	October 1981	Algorithms
Maximizing Power in Association Studies	E. Halperin and D. A. Stephan	Nature Biotechnology, Vol. 27, Issue 3, pp. 255-256	March 2009	Algorithms	[PDF]
Mathematical Challenges from Genomics and Molecular Biology	R. M. Karp	Notices of the American Mathematical Society, Vol. 49, No. 5, pp. 544-553	2002	Algorithms
Mapping the Genome: some combinatorial problems arising in molecular biology	R. M. Karp	Proceedings of 25th Annual Symposium on the Theory of Computing, San Diego, California, pp. 278-85	May 1993	Algorithms
Mapping Clones with a Given Ordering or Interleaving	T. Jiang and R.M. Karp	Algorithmica, July 1998, vol.21, (no.3):262-84.	1998	Algorithms
Mapping Clones with a Given Ordering or Interleaving	T. Jiang and R.M. Karp	Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Jan. 1997. New York, NY, USA: ACM, 1997. p. 400-9.	January 1997	Algorithms
Managing Energy in a Virtual Power Plant Using Learning Classifier Systems	O. Kramer, B. Satzger, and J. Laessig	Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods (GEM 2010), Las Vegas, Nevada	July 2010	Algorithms	[PDF]
Malicious Bayesian Congestion Games	M. Gairing	Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA'08), Universität Karlsruhe, Germany, pp. 119-132	September 2008	Algorithms	[PDF]

Pages