Search results for "lemma"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Joseph O'Rourke	An Extension of Cauchy's Arm Lemma with Application to Curve Development.	JCDCG	2000	DBLP DOI BibTeX RDF
22	Monika Seisenberger	An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma.	TYPES	2000	DBLP DOI BibTeX RDF
22	Naoki Katoh, Takeshi Tokuyama	Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications.	FOCS	1999	DBLP DOI BibTeX RDF	K-set, K-level, Computational Geometry, Matroids
18	Ramamohan Paturi, Pavel Pudlák	On the complexity of circuit satisfiability.	STOC	2010	DBLP DOI BibTeX RDF	NP-completeness, circuit satisfiability
18	Jianbin Qiu, Gang Feng 0001, Jie Yang 0004	Robust H∞ static output feedback control of discrete-time switched polytopic linear systems with average dwell-time.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	static output feedback, average dwell-time, time-varying uncertainty, H ? control, linear matrix inequality, switched systems
18	Emmanuel Nuno, Luis Basañez, Miguel Prada	Asymptotic stability of teleoperators with variable time-delays.	ICRA	2009	DBLP DOI BibTeX RDF
18	Arnab Bhattacharya 0001, Purushottam Kar, Manjish Pal	On Low Distortion Embeddings of Statistical Distance Measures into Low Dimensional Spaces.	DEXA	2009	DBLP DOI BibTeX RDF
18	Heidi Gebauer	Disproof of the Neighborhood Conjecture with Implications to SAT.	ESA	2009	DBLP DOI BibTeX RDF
18	Zoltán Szabó 0001, András Lörincz	Fast Parallel Estimation of High Dimensional Information Theoretical Quantities with Low Dimensional Random Projection Ensembles.	ICA	2009	DBLP DOI BibTeX RDF	Independent subspace analysis, pairwise distances, information theoretical estimations, random projection
18	Yijia Chen, Jörg Flum, Moritz Müller	Lower Bounds for Kernelizations and Other Preprocessing Procedures.	CiE	2009	DBLP DOI BibTeX RDF	kernelization, preprocessing, Parameterized complexity
18	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification via Space-Efficient Direct Products.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17
18	Anuj Dawar, Stephan Kreutzer	On Datalog vs. LFP.	ICALP (2)	2008	DBLP DOI BibTeX RDF
18	Kenneth L. Clarkson	Tighter bounds for random projections of manifolds.	SCG	2008	DBLP DOI BibTeX RDF	johnson-lindenstrauss random projection
18	Marcos G. Todorov, Marcelo D. Fragoso	Output feedback Hinfinity control of continuous-time infinite Markovian jump linear systems via LMI methods.	CDC	2008	DBLP DOI BibTeX RDF
18	Alexander L. Fradkov	Passification of linear systems with respect to given output.	CDC	2008	DBLP DOI BibTeX RDF
18	Mário Macedo, Mário Serafim Nunes, António Grilo 0001	Minimizing Interference in TDMA MAC Protocols for WSN Operating in Shadow-Fading Channels.	EuroNGI Workshop	2008	DBLP DOI BibTeX RDF	TDMA MAC protocols, Slot Allocation, Shadow Fading Channel, Wireless Sensor Networks, Interference Avoidance
18	Richárd Farkas, Veronika Vincze, István Nagy T., Róbert Ormándi, György Szarvas, Attila Almási	Web-Based Lemmatisation of Named Entities.	TSD	2008	DBLP DOI BibTeX RDF	Lemmatisation, named entity recognition, web-based techniques
18	Irit Dinur	The PCP theorem by gap amplification.	J. ACM	2007	DBLP DOI BibTeX RDF	Gap amplification, PCP
18	Andrea Ernst-Gerlach, Norbert Fuhr	Retrieval in text collections with historic spelling using linguistic and spelling variants.	JCDL	2007	DBLP DOI BibTeX RDF	rule-based search, spelling variants, historic documents
18	Elena Irimia	ROG - A Paradigmatic Morphological Generator for Romanian.	LTC	2007	DBLP DOI BibTeX RDF	paradigmatic morphology, morphological generator
18	Decheng Ding, Klaus Weihrauch, Yongcheng Wu	Absolutely Non-effective Predicates and Functions in Computable Analysis.	TAMC	2007	DBLP DOI BibTeX RDF	measure, computability, representation, set, undecidability
18	Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu	On the Complexity of Hard-Core Set Constructions.	ICALP	2007	DBLP DOI BibTeX RDF
18	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics.	INAP/WLP	2007	DBLP DOI BibTeX RDF
18	Yi-Xue Lei, Z.-M. Zeng	QoS-Aware MAP Selection Scheme Based on Average Handover Delay for Multimedia Services in Multi-level HMIPv6 Networks.	International Conference on Computational Science (4)	2007	DBLP DOI BibTeX RDF	Hierarchical Mobile IPv6 (HMIPv6), Mobility Anchor Point (MAP), handover delay, Quality of Service (QoS)
18	Shunsuke Koshita, Yousuke Mizukami, Taketo Konno, Masahide Abe, Masayuki Kawamata	Analysis of Second-Order Modes of Linear Continuous-Time Systems under Positive-Real Transformations.	ISCAS	2007	DBLP DOI BibTeX RDF
18	Reynald Affeldt, Miki Tanaka, Nicolas Marti	Formal Proof of Provable Security by Game-Playing in a Proof Assistant.	ProvSec	2007	DBLP DOI BibTeX RDF
18	Gyula Pap	Some new results on node-capacitated packing of A-paths.	STOC	2007	DBLP DOI BibTeX RDF	node-capacities, paths-packing, algorithms
18	Wei Mao, Xin Su, Xinbin Xu	Comments on "Correlated Jamming on MIMO Gaussian Fading Channels".	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
18	Ji-Chang Lo, Min-Long Lin	Robust H∞ control for fuzzy systems with Frobenius norm-bounded uncertainties.	IEEE Trans. Fuzzy Syst.	2006	DBLP DOI BibTeX RDF
18	Carl de Boor	On interpolation by radial polynomials.	Adv. Comput. Math.	2006	DBLP DOI BibTeX RDF	interpolation, polynomial, multivariate
18	Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng	Computing Nash Equilibria: Approximation and Smoothed Complexity.	FOCS	2006	DBLP DOI BibTeX RDF
18	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets	Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification.	FOCS	2006	DBLP DOI BibTeX RDF
18	Uli Wagner 0001	On a Geometric Generalization of the Upper Bound Theorem.	FOCS	2006	DBLP DOI BibTeX RDF
18	Naokata Shikuma, Atsushi Igarashi	Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-Calculus.	ASIAN	2006	DBLP DOI BibTeX RDF
18	Markus Forsberg, Harald Hammarström, Aarne Ranta	Morphological Lexicon Extraction from Raw Text Data.	FinTAL	2006	DBLP DOI BibTeX RDF
18	Nader H. Bshouty, Hanna Mazzawi	Exact Learning Composed Classes with a Small Number of Mistakes.	COLT	2006	DBLP DOI BibTeX RDF
18	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification Via Space-Efficient Direct Products.	LATIN	2006	DBLP DOI BibTeX RDF	error-correcting codes, expanders, Direct products, hardness amplification
18	Arindam Banerjee 0001	On Bayesian bounds.	ICML	2006	DBLP DOI BibTeX RDF
18	George Tambouratzis, Sokratis Sofianopoulos, Vassiliki Spilioti, Marina Vassiliou, Olga Yannoutsou, Stella Markantonatou	Pattern Matching-Based System for Machine Translation (MT).	SETN	2006	DBLP DOI BibTeX RDF
18	Bo Brinkman, Moses Charikar	On the impossibility of dimension reduction in l1.	J. ACM	2005	DBLP DOI BibTeX RDF	embedding, Metric spaces, dimension reduction
18	Maria Bulinska	The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms.	Stud Logica	2005	DBLP DOI BibTeX RDF	Lambek, grammar, calculus, context-free
18	Shi-Chun Tsai, Wen-Guey Tzeng, Hsin-Lung Wu	On the Jensen-Shannon Divergence and Variational Distance.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
18	Todd K. Moon, Jacob H. Gunther	On the equivalence of two Welch-Berlekamp key equations and their error evaluators.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
18	Clayton D. Scott, Robert D. Nowak	A Neyman-Pearson approach to statistical learning.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
18	Tuangthong Wattarujeekrit, Nigel Collier	Exploring Predicate-Argument Relations for Named Entity Recognition in the Molecular Biology Domain.	Discovery Science	2005	DBLP DOI BibTeX RDF
18	Hermann Gruber, Markus Holzer 0001, Astrid Kiehn, Barbara König 0001	On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
18	Eyal Gordon, Adi Rosén	Competitive weighted throughput analysis of greedy protocols on DAGs.	PODC	2005	DBLP DOI BibTeX RDF
18	Qimin Zhang, Chongzhao Han	Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population.	AAIM	2005	DBLP DOI BibTeX RDF
18	Fumiaki Okushi, Allen Van Gelder	Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	Modoc, lemmas, satisfiability, resolution, refutation, Model Elimination
18	Jirí Matousek 0001	A Combinatorial Proof of Kneser's Conjecture.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05A05, 55M35
18	George Kafkoulis	Coding lemmata in L.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	Elementary projectum, Prewellordering, Embeddings, Coding
18	Valentina Damerow, Christian Sohler	Extreme Points Under Random Noise.	ESA	2004	DBLP DOI BibTeX RDF
18	Yuhan Cai, Raymond T. Ng	Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials. (PDF / PS)	SIGMOD Conference	2004	DBLP DOI BibTeX RDF
18	Andreas Maletti	Relating Tree Series Transducers and Weighted Tree Automata.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
18	Jonathan A. Kelner	Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.	STOC	2004	DBLP DOI BibTeX RDF	bounded genus, circle packing, partitioning, laplacian, graph separators, spectral partitioning
18	Ronen Shaltiel	Towards proving strong direct product theorems.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q17, 68Q15
18	Maria Luisa Bonet, Nicola Galesi	Degree complexity for a modified pigeonhole principle.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
18	Evan J. Griffiths	Limit lemmas and jump inversion in the enumeration degrees.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
18	Bo Brinkman, Moses Charikar	On the Impossibility of Dimension Reduction in l1.	FOCS	2003	DBLP DOI BibTeX RDF
18	Dorit Aharonov, Amnon Ta-Shma	Adiabatic quantum state generation and statistical zero knowledge.	STOC	2003	DBLP DOI BibTeX RDF	quantum adiabatic computation, quantum sampling, spectral gap, state generation, statistical zero knowledge, Markov chains, Hamiltonian
18	Erich L. Kaltofen	Polynomial factorization: a success story.	ISSAC	2003	DBLP DOI BibTeX RDF	black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program
18	R. Ravi 0001, David P. Williamson	Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.	Algorithmica	2002	DBLP DOI BibTeX RDF
18	Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001	Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.	ISAAC	2002	DBLP DOI BibTeX RDF
18	Lars Engebretsen, Piotr Indyk, Ryan O'Donnell	Derandomized dimensionality reduction with applications.	SODA	2002	DBLP BibTeX RDF
18	Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.	FOCS	2002	DBLP DOI BibTeX RDF
18	Heiko Mantel	On the Composition of Secure Systems.	S&P	2002	DBLP DOI BibTeX RDF	composition, information flow, compositionality, noninterference, emergent properties
18	Carsten Wegener, Michael Peter Kennedy	Implementation of Model-Based Testing for Medium to High-Resolution Nyquist-Rate ADCs.	ITC	2002	DBLP DOI BibTeX RDF
18	Lisa Fleischer	A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity.	IPCO	2001	DBLP DOI BibTeX RDF
18	Amit Chakrabarti, Subhash Khot	Improved Lower Bounds on the Randomized Complexity of Graph Properties.	ICALP	2001	DBLP DOI BibTeX RDF	Decision tree complexity, monotone graph properties, randomized complexity, graph packing, randomized algorithms, probabilistic method
18	Pranab Sen, Srinivasan Venkatesh 0001	Lower Bounds in the Quantum Cell Probe Model.	ICALP	2001	DBLP DOI BibTeX RDF
18	Adam R. Klivans, Daniel A. Spielman	Randomness efficient identity testing of multivariate polynomials.	STOC	2001	DBLP DOI BibTeX RDF
18	Ronen Shaltiel	Towards Proving Strong Direct Product Theorems.	CCC	2001	DBLP DOI BibTeX RDF
18	Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich	K-D Trees Are Better when Cut on the Longest Side.	ESA	2000	DBLP DOI BibTeX RDF
18	Hilary A. Priestley	Ordered Sets and Complete Lattices.	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction	2000	DBLP DOI BibTeX RDF
18	Alan M. Frieze, Ravi Kannan	Quick Approximation to Matrices and Applications.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R05
18	Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa	Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68M20, 68M07, 60C05, 68M10
18	Jean-Marc Andreoli, Roberto Maieli	Fucusing and Proof-Nets in Linear and Non-commutative Logic.	LPAR	1999	DBLP DOI BibTeX RDF
18	David Delahaye	Information Retrieval in a Coq Proof Library Using Type Isomorphisms.	TYPES	1999	DBLP DOI BibTeX RDF
18	Fred G. Gustavson, José E. Moreira, Robert F. Enenkel	The fused multiply-add instruction leads to algorithms for extended-precision floating point: applications to java and high-performance computing.	CASCON	1999	DBLP BibTeX RDF	Java
18	Paul Beame, Russell Impagliazzo, Toniann Pitassi	Improved Depth Lower Bounds for Small Distance Connectivity.	Comput. Complex.	1998	DBLP DOI BibTeX RDF	switching lemmas, resource tradeoffs, Circuit complexity, graph connectivity
18	Ulrich Kohlenbach	Elimination of Skolem functions for monotone formulas in analysis.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification: 03F35, 03F10, 03F03, 03F25
18	Danièle Beauquier	Pumping Lemmas for Timed Automata.	FoSSaCS	1998	DBLP DOI BibTeX RDF
18	Thierry Coquand, Henrik Persson	Gröbner Bases in Type Theory.	TYPES	1998	DBLP DOI BibTeX RDF
18	Leslie Ann Goldberg, Mark Jerrum	The "Burnside Process" Converges Slowly.	RANDOM	1998	DBLP DOI BibTeX RDF
18	Guillaume Poupard, Jacques Stern	Security Analysis of a Practical "on the fly" Authentication and Signature Generation.	EUROCRYPT	1998	DBLP DOI BibTeX RDF	general discrete logarithm problem, minimal on-line computation, low cost smart cards, digital signature, security analysis, Identification scheme
18	Takahisa Mohri	On Formalization of Bicategory Theory.	TPHOLs	1997	DBLP DOI BibTeX RDF
18	Monika Rauch Henzinger, Mikkel Thorup	Improved Sampling with Applications to Dynamic Graph Algorithms.	ICALP	1996	DBLP DOI BibTeX RDF
18	Elias Koutsoupias, Christos H. Papadimitriou	On the k-Server Conjecture.	J. ACM	1995	DBLP DOI BibTeX RDF	k-server problem, quasiconvexity, work function, online algorithms, competitive analysis, potential
18	Mihir Bellare, Joe Kilian, Phillip Rogaway	The Security of Cipher Block Chaining.	CRYPTO	1994	DBLP DOI BibTeX RDF
18	Hubert Comon	Completion of Rewrite Systems with Membership Constraints.	ICALP	1992	DBLP DOI BibTeX RDF
18	Wiebe van der Hoek	Some Considerations on the Logic PfD.	RCLP	1991	DBLP DOI BibTeX RDF
18	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).	RTA	1991	DBLP DOI BibTeX RDF	orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms
18	Dan Benanav	Simultaneous Paramodulation.	CADE	1990	DBLP DOI BibTeX RDF
18	Michal Chytil	Kins of Context-Free Languages.	MFCS	1986	DBLP DOI BibTeX RDF
18	Arnold Schönhage	Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm.	ICALP	1984	DBLP DOI BibTeX RDF
18	David G. Cantor	On The Ambiguity Problem of Backus Systems.	J. ACM	1962	DBLP DOI BibTeX RDF
18	David D. Morrison	Remarks on the Unitary Triangularization of a Nonsymmetric Matrix.	J. ACM	1960	DBLP DOI BibTeX RDF
17	Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari	Maximal Zone Diagrams and their Computation.	ISVD	2010	DBLP DOI BibTeX RDF	zone diagram, Zorn's lemma, computational geometry, Voronoi diagram
17	Xi Chen 0001, Xiaotie Deng	A Simplicial Approach for Discrete Fixed Point Theorems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Sperner’s lemma, Direction-preserving map, Simplicial structure, Fixed point theorem
17	Xi Chen 0001, Xiaotie Deng, Shang-Hua Teng	Settling the complexity of computing two-player Nash equilibria.	J. ACM	2009	DBLP DOI BibTeX RDF	Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game