Search results for "Epsilon"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
182	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-efficient approximate Voronoi diagrams.	STOC	2002	DBLP DOI BibTeX RDF
171	Venkatesan Guruswami, Atri Rudra	Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes.	CCC	2008	DBLP DOI BibTeX RDF
155	Yuh-Jye Lee, Wen-Feng Hsieh, Chien-Ming Huang 0002	epsilon-SSVR: A Smooth Support Vector Machine for epsilon-Insensitive Regression.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	epsilon{hbox{-}}{rm{insensitive}} loss function, epsilon{hbox{-}}{rm{smooth}} support vector regression, Newton-Armijo algorithm, support vector machine, kernel method
96	Josée Desharnais, François Laviolette, Mathieu Tracol	Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.	QEST	2008	DBLP DOI BibTeX RDF
96	Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci	Area-Universal Circuits with Constant Slowdown.	ARVLSI	1999	DBLP DOI BibTeX RDF
90	Phillip G. Bradford, Vasilis Capoyleas	Weak epsilon-Nets for Points on a Hypersphere.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
85	Ran Raz	A Counterexample to Strong Parallel Repetition.	FOCS	2008	DBLP DOI BibTeX RDF
75	Dana Moshkovitz, Ran Raz	Two Query PCP with Sub-Constant Error.	FOCS	2008	DBLP DOI BibTeX RDF
68	Siegfried M. Rump	A Note on Epsilon-Inflation.	Reliab. Comput.	1998	DBLP DOI BibTeX RDF
67	Georg Moser, Richard Zach	The Epsilon Calculus and Herbrand Complexity.	Stud Logica	2006	DBLP DOI BibTeX RDF	Hilbert's ?-calculus, epsilon theorems, Herbrand's theorem, proof complexity
64	Saurabh Ray, Nabil H. Mustafa	Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.	SCG	2007	DBLP DOI BibTeX RDF	hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry
64	Dimitris Fotakis 0001, Rasmus Pagh, Peter Sanders 0001, Paul G. Spirakis	Space Efficient Hash Tables with Worst Case Constant Access Time.	STACS	2003	DBLP DOI BibTeX RDF
64	Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal 0001	High-Dimensional Similarity Joins.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	similar time sequences, Data mining, similarity join
64	Subhash Khot	On the power of unique 2-prover 1-round games.	STOC	2002	DBLP DOI BibTeX RDF
64	Subhash Khot	On the Power of Unique 2-Prover 1-Round Games.	CCC	2002	DBLP DOI BibTeX RDF	2-prover games, Hardness of approximation, probabilistically checkable proofs
64	Ian Agol, Joel Hass, William P. Thurston	3-MANIFOLD KNOT GENUS is NP-complete.	CCC	2002	DBLP DOI BibTeX RDF	2-prover games, Hardness of approximation, probabilistically checkable proofs
58	Wolfgang Mader 0001	Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C83, 05C35
53	Jagan Sankaranarayanan, Hanan Samet	Distance Oracles for Spatial Networks.	ICDE	2009	DBLP DOI BibTeX RDF
53	Yuh-Rau Wang, Shi-Jinn Horng, Chin-Hsiung Wu	Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	LARPBS, reconfigurable bus model, Parallel algorithm, closest pair, all nearest neighbors
53	Yuh-Rau Wang, Shi-Jinn Horng	An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	Computer vision, parallel algorithm, image processing, Voronoi diagram, Euclidean distance transform, CRCW PRAM model
53	Amnon Ta-Shma	Almost Optimal Dispersers.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q01, 68R10
53	Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami	Quantum DNF Learnability Revisited.	COCOON	2002	DBLP DOI BibTeX RDF
53	Elchanan Mossel, Christopher Umans	On the Complexity of Approximating the VC Dimension.	CCC	2001	DBLP DOI BibTeX RDF
53	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy	Efficient Testing of Large Graphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68R10, 05C35, 05C85
53	Kunihiko Sadakane	Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array.	ISAAC	2000	DBLP DOI BibTeX RDF
53	Steven J. Phillips, Jeffery R. Westbrook	Approximation Algorithms for Restoration Capacity Planning.	ESA	1999	DBLP DOI BibTeX RDF
52	Ying-Hong Wang	Image Indexing and Similarity Retrieval Based on A New Spatial Relation Model.	ICDCS Workshops	2001	DBLP DOI BibTeX RDF	2-D Strings, LCS algorithm, 2D B&epsilon-string, Image retrieval, image database, spatial reasoning, similarity retrieval, spatial knowledge
47	Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack	The Epsilon Transformation Language.	ICMT@TOOLS	2008	DBLP DOI BibTeX RDF
47	Joshua B. Kollat, Patrick M. Reed	The Value of Online Adaptive Search: A Performance Comparison of NSGAII, epsilon-NSGAII and epsilonMOEA.	EMO	2005	DBLP DOI BibTeX RDF
47	Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack	An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.	SWAT	1998	DBLP DOI BibTeX RDF
45	Yuval Rabani, Amir Shpilka	Explicit construction of a small epsilon-net for linear threshold functions.	STOC	2009	DBLP DOI BibTeX RDF	linear threshold function, explicit construction, epsilon-net
45	Tatsuo Arai	Epsilon substitution method for [Pi01, Pi01]-FIX.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Epsilon substitution, Ordinal interpretation, Termination proof
45	Henry Towsner	Epsilon substitution for transfinite induction.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Epsilon substitution, Cut elimination
45	Grigori Mints, Darko Sarenac	Completeness of indexed epsilon-calculus.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF	Epsilon calculus, Finite choice, Completeness
45	Pamela Drew, Calton Pu	Asynchronous consistency restoration under epsilon serializability.	HICSS (2)	1995	DBLP DOI BibTeX RDF	consistency restoration, epsilon serializability, data inconsistency, data integrity, concurrency control, object-oriented databases, inconsistency, concurrent processing
44	Saharon Shelah	In the Random Graph G(n, p), p = n-a: If psi Has Probability O(n-epsilon) for Every epsilon>0 Then it Has Probability O(e-nepsilon) for Some epsilon>0.	Ann. Pure Appl. Log.	1996	DBLP DOI BibTeX RDF
44	Raja Epsilon, Jun Ke, Carey L. Williamson	Analysis of ISP IP/ATM network traffic measurements.	SIGMETRICS Perform. Evaluation Rev.	1999	DBLP DOI BibTeX RDF	wworkload characterization, web, TCP/IP, TCP/IP, ATM networks, network traffic measurement
44	James W. Gray III, Kin Fai Epsilon Ip, King-Shan Lui	Provable Security for Cryptographic Protocols - Exact Analysis and Engineering Applications.	J. Comput. Secur.	1998	DBLP DOI BibTeX RDF
44	James W. Gray III, Kin Fai Epsilon Ip, King-Shan Lui	Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications.	CSFW	1997	DBLP DOI BibTeX RDF
44	James W. Gray III, Kin Fai Epsilon Ip	Protocols for issuing public-key certificates over the Internet.	ICICS	1997	DBLP DOI BibTeX RDF
43	Yingquan Wu	New List Decoding Algorithms for Reed-Solomon and BCH Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
43	Monaldo Mastrolilli, Ola Svensson	(Acyclic) JobShops are Hard to Approximate.	FOCS	2008	DBLP DOI BibTeX RDF
43	Harry Buhrman, John M. Hitchcock	NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.	CCC	2008	DBLP DOI BibTeX RDF	hard sets, polynomial advice, instance complexity
43	Eric Allender, Michal Koucký 0001	Amplifying Lower Bounds by Means of Self-Reducibility.	CCC	2008	DBLP DOI BibTeX RDF	self-reducibility, lower bounds, circuit complexity
43	Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilkerson	SNDL-MOEA: stored non-domination level MOEA.	GECCO	2007	DBLP DOI BibTeX RDF	constructive problem solving, pareto optimality, evolutionary multiobjective optimization
43	Xuemin Lin 0001, Jian Xu, Qing Zhang 0001, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou 0001, Yidong Yuan	Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	data mining, Query processing, online computation
43	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
43	Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004	Computing Diameter in the Streaming and Sliding-Window Models.	Algorithmica	2005	DBLP DOI BibTeX RDF	Massive data streams, Diameter, Sliding window
43	Erez Petrank, Gábor Tardos	On the Knowledge Complexity of NP.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q15, 68Q17
43	Oded Goldreich 0001, Avi Wigderson	Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.	RANDOM	2002	DBLP DOI BibTeX RDF
43	Mario Szegedy, Xiaomin Chen	Computing Boolean Functions from Multiple Faulty Copies of Input Bits.	LATIN	2002	DBLP DOI BibTeX RDF
43	Jonas Holmerin	Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε.	CCC	2002	DBLP DOI BibTeX RDF
43	Todd W. Neller	Action Timing Discretization with Iterative-Refinement.	SARA	2002	DBLP DOI BibTeX RDF
43	John A. Rose, Russell J. Deaton, Masami Hagiya, Akira Suyama	The Fidelity of the Tag-Antitag System.	DNA	2001	DBLP DOI BibTeX RDF
43	Jop F. Sibeyn	Solving Fundamental Problems on Sparse-Meshes.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Theory of parallel computation, algorithms, routing, networks, sorting, meshes, list-ranking
43	Michael Elkin, David Peleg	Strong Inapproximability of the Basic k-Spanner Problem.	ICALP	2000	DBLP DOI BibTeX RDF
43	Mikael Goldmann, Alexander Russell	Spectral Bounds on General Hard Core Predicates.	STACS	2000	DBLP DOI BibTeX RDF
43	Limor Drori, David Peleg	Faster Exact Solutions for Some NP-Hard Problems.	ESA	1999	DBLP DOI BibTeX RDF
43	Samarjit Chakraborty, Somenath Biswas	Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules.	WADS	1999	DBLP DOI BibTeX RDF
43	Michael T. Goodrich, John G. Kloss II	Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences.	WADS	1999	DBLP DOI BibTeX RDF	dynamic array, JDSL, Java, vector, abstract data type
43	Philip N. Klein, Sairam Subramanian	A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF	Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm
43	Keqin Li 0001, Yi Pan 0001, Si-Qing Zheng	Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Compound algorithm, optical pipelined bus, Strassen's algorithm, reconfigurability, matrix multiplication, linear array
43	Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron	Testing Monotonicity.	FOCS	1998	DBLP DOI BibTeX RDF	Approximation Algorithms, Randomized Algorithms, Monotonicity, Property Testing
43	Danny Z. Chen, Ovidiu Daescu	Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space.	COCOON	1998	DBLP DOI BibTeX RDF
41	Helen Treharne, Edward Turner, Richard F. Paige, Dimitrios S. Kolovos	Automatic Generation of Integrated Formal Models Corresponding to UML System Models.	TOOLS (47)	2009	DBLP DOI BibTeX RDF	Epsilon, UML, Model transformation, CSP, B
41	Guy Bernard, Andrzej Duda, Yoram Haddad 0002, Gilbert Harrus	Primitives for Distributed Computing in a Heterogeneous Local Area Network Environment.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	heterogeneous local area network environment, interprocess communication mechanisms, network aspects, Epsilon, high-level communication primitives, host names, software engineering, distributed computing, operating systems, local area networks, distributed applications, source code, heterogeneous computers, microcomputers, computer communications software, hardware configuration
36	János Pach, Gábor Tardos	Tight lower bounds for the size of epsilon-nets.	SCG	2011	DBLP DOI BibTeX RDF
36	Hernán E. Aguirre, Kiyoshi Tanaka	Space partitioning with adaptive epsilon-ranking and substitute distance assignments: a comparative study on many-objective mnk-landscapes.	GECCO	2009	DBLP DOI BibTeX RDF	evolutionary many-objective optimazation, non-linear fitness functions, combinatorial problems, epistasis
36	Dimitrios S. Kolovos	Establishing Correspondences between Models with the Epsilon Comparison Language.	ECMDA-FA	2009	DBLP DOI BibTeX RDF
36	Christian Horoba, Frank Neumann 0001	Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization.	GECCO	2008	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis
35	Pablo Diaz-Gutierrez, Jonas Bösch, Renato Pajarola, Meenakshisundaram Gopi	Streaming surface sampling using Gaussian epsilon-nets.	Vis. Comput.	2009	DBLP DOI BibTeX RDF	Normal quantization, Surface sampling, Shape approximation, Epsilon-nets
35	Kasturi R. Varadarajan	Epsilon nets and union complexity.	SCG	2009	DBLP DOI BibTeX RDF	approximation algorithms, set cover, epsilon nets
35	Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch	Lower bounds for weak epsilon-nets and stair-convexity.	SCG	2009	DBLP DOI BibTeX RDF	inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net
35	Boris Aronov, Sariel Har-Peled, Micha Sharir	On approximate halfspace range counting and relative epsilon-approximations.	SCG	2007	DBLP DOI BibTeX RDF	approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces
35	Ricardo Landa Becerra, Carlos A. Coello Coello	Epsilon-constraint with an efficient cultured differential evolution.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	epsilon-constraint, multi-objective optimization, differential evolution, cultural algorithms
35	Jirí Matousek 0001	New constructions of weak epsilon-nets.	SCG	2003	DBLP DOI BibTeX RDF	weak epsilon-nets
35	Florent Duguet, George Drettakis	Robust epsilon visibility.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF	3D visibility, epsilon visibility, robust visibility predicates, illumination, shadow algorithms
35	Kun-Lung Wu, Philip S. Yu, Calton Pu	Divergence Control Algorithms for Epsilon Serializability.	IEEE Trans. Knowl. Data Eng.	1997	DBLP DOI BibTeX RDF	Epsilon serializability, divergence control, concurrency control, transaction processing, serializability
32	Ting Wang 0006, Shicong Meng, Bhuvan Bamba, Ling Liu 0001, Calton Pu	A General Proximity Privacy Principle.	ICDE	2009	DBLP DOI BibTeX RDF
32	Irit Dinur, Elazar Goldenberg	Locally Testing Direct Product in the Low Error Range.	FOCS	2008	DBLP DOI BibTeX RDF
32	Tetsuo Tamai, Naoyasu Ubayashi, Ryoichi Ichiyama	Objects as Actors Assuming Roles in the Environment.	SELMAS (LNCS)	2006	DBLP DOI BibTeX RDF
32	Tetsuo Tamai, Naoyasu Ubayashi, Ryoichi Ichiyama	An adaptive object model with dynamic role binding.	ICSE	2005	DBLP DOI BibTeX RDF	adaptation, separation of concerns, role model
32	Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu	Compressed Index for Dynamic Text.	Data Compression Conference	2004	DBLP DOI BibTeX RDF
32	Yossi Matias, Ely Porat	Efficient Pebbling for List Traversal Synopses.	ICALP	2003	DBLP DOI BibTeX RDF
32	Piotr Sankowski	Alternative Algorithms for Counting All Matchings in Graphs.	STACS	2003	DBLP DOI BibTeX RDF
32	Jinhui Xu 0001, Yang Yang 0012, Zhiyong Lin	Traveling Salesman Problem of Segments.	COCOON	2003	DBLP DOI BibTeX RDF
32	Jin-yi Cai	On the Minimum Volume of a Perturbed Unit Cube.	ISAAC	2002	DBLP DOI BibTeX RDF
32	Wing-Kai Hon, Kunihiko Sadakane	Space-Economical Algorithms for Finding Maximal Unique Matches.	CPM	2002	DBLP DOI BibTeX RDF
32	Klaus Jansen	Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme.	ESA	2002	DBLP DOI BibTeX RDF
32	Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma 0002, Lusheng Wang 0001	A PTAS for Distinguishing (Sub)string Selection.	ICALP	2002	DBLP DOI BibTeX RDF
32	Horng-Ren Tsai	Parallel Algorithms for the Medial Axis Transform on Linear Arrays with a Reconfigurable Pipelined Bus System.	ICPADS	2002	DBLP DOI BibTeX RDF	linear array with a reconfigurable pipelined bus system, computer vision, parallel algorithms, image processing, image compression, Medial axis transform
32	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	Randomness-Optimal Characterization of Two NP Proof Systems.	RANDOM	2002	DBLP DOI BibTeX RDF
32	Tony W. Lai	Paging on a RAM with Limited Resources.	SWAT	2002	DBLP DOI BibTeX RDF
32	Eyal Even-Dar, Shie Mannor, Yishay Mansour	PAC Bounds for Multi-armed Bandit and Markov Decision Processes.	COLT	2002	DBLP DOI BibTeX RDF
32	Miklós Ajtai, Ravi Kumar 0001, D. Sivakumar 0001	Sampling Short Lattice Vectors and the Closest Lattice Vector Problem.	CCC	2002	DBLP DOI BibTeX RDF	SVP, CVP, Lattice, shortest vector problem, closest vector problem
32	Friedhelm Meyer auf der Heide, Christian Scheideler	Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68W10, 68W20, 68W15
32	Vladlen Koltun	Segment intersection searching problems in general settings.	SCG	2001	DBLP DOI BibTeX RDF
32	Eli Ben-Sasson, Nicola Galesi	Space Complexity of Random Formulae in Resolution.	CCC	2001	DBLP DOI BibTeX RDF
32	Michael A. Bender, Dana Ron	Testing Acyclicity of Directed Graphs in Sublinear Time.	ICALP	2000	DBLP DOI BibTeX RDF
32	Jorge Nakahara Jr., Bart Preneel, Joos Vandewalle	Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family.	FSE	2000	DBLP DOI BibTeX RDF