Search results for "Epsilon"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
32	Toshihiro Fujito	On Approximability of the Independent/Connected Edge Dominating Set Problems.	FSTTCS	2000	DBLP DOI BibTeX RDF
32	Ran Raz, Pierre McKenzie	Separation of the Monotone NC Hierarchy.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25
32	Cyril Gavoille, Nicolas Hanusse	Compact Routing Tables for Graphs of Bounded Genus.	ICALP	1999	DBLP DOI BibTeX RDF
32	Gabriele Neyer	Line Simplification with Restricted Orientations.	WADS	1999	DBLP DOI BibTeX RDF
32	Ziv Bar-Yossef, Oded Goldreich 0001, Avi Wigderson	Deterministic Amplification of Space-Bounded Probabilistic Algorithms.	CCC	1999	DBLP DOI BibTeX RDF	space bounded randomized computation, deterministic amplification, expander graphs
32	Ravi Kumar 0001, D. Sivakumar 0001	Proofs, Codes, and Polynomial-Time Reducibilities.	CCC	1999	DBLP DOI BibTeX RDF	reducibilities, proof systems, partial solutions
32	Koji Nakano, Stephan Olariu	An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Monotone matrices, totally monotone matrices, row minima, basic reconfigurable meshes, cellular system design, VLSI design, search problems, reconfigurable meshes, facility location problems
32	Sanguthevar Rajasekaran, Insup Lee 0001	Parallel Algorithms for Relational Coarsest Partition Problems.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Bisimulation checking, coarsest partition problems, analysis of concurrent systems, parallel algorithms, labeled transition systems
32	Walter Unger	The Complexity of the Approximation of the Bandwidth Problem.	FOCS	1998	DBLP DOI BibTeX RDF	comlexity, approximation, bandwidth
32	Sameer A. Nene, Shree K. Nayar	Closest Point Search in High Dimensions.	CVPR	1996	DBLP DOI BibTeX RDF	projection search, searching by slicing, object recognition, benchmarks, Pattern classification, nearest neighbor, closest point
32	Uriel Feige, Joe Kilian	Zero Knowledge and the Chromatic Number.	CCC	1996	DBLP DOI BibTeX RDF	approximation algorithms, zero knowledge, chromatic number, probabilistically checkable proofs
32	Kwan Woo Ryu, Joseph F. JáJá	Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition
31	Piya Tanthawichian, Akihiro Fujii, Yoshiaki Nemoto	Bandwidth Allocation in ATM Networks: Heuristic Approach.	ICCCN	1998	DBLP DOI BibTeX RDF	CAC $epsilon$-quantile function, Bandwidth Allocation, Heuristic Approach
31	David Fernández-Baca	Allocating Modules to Processors in a Distributed System.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	execution costs, P=NP, polynomial-time epsilon -approximate algorithm, optimum assignment, almost-tree, module allocation problem, distributed system, computational complexity, complexity, graph theory, distributed processing, iteration, polynomial time, planar, bipartite, partial k-tree, local search algorithm, communication graph
30	Michael Gimelfarb, Scott Sanner, Chi-Guhn Lee	Epsilon-BMC: A Bayesian Ensemble Approach to Epsilon-Greedy Exploration in Model-Free Reinforcement Learning. (PDF / PS)	UAI	2019	DBLP BibTeX RDF
30	Andreas Wiese	Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking.	Algorithmica	2018	DBLP DOI BibTeX RDF
30	Dong Quan Vu, Patrick Loiseau, Alonso Silva	A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games.	AAMAS	2018	DBLP BibTeX RDF
30	Jeffrey L. Popyack, Orlando S. Madrigal	UPSILON PI EPSILON: Upsilon Pi Epsilon's half century.	Inroads	2017	DBLP DOI BibTeX RDF
30	Nabil H. Mustafa, Kasturi R. Varadarajan	Epsilon-approximations and epsilon-nets.	CoRR	2017	DBLP BibTeX RDF
30	El Makki Voundy	Langages epsilon-sûrs et caractérisations des langages d'ordres supérieurs. (Epsilon-safe languages and characterizations of higher order languages).		2017	RDF
30	David Felber, Rafail Ostrovsky	A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words.	APPROX-RANDOM	2015	DBLP DOI BibTeX RDF
30	Nabil H. Mustafa, Saurabh Ray	Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.	Comput. Geom.	2010	DBLP DOI BibTeX RDF
30	Xueling Ma, Jianming Zhan 0001, Bijan Davvaz, Young Bae Jun	Some kinds of (epsilon, epsilon or q)-interval-valued fuzzy ideals of BCI-algebras	Inf. Sci.	2008	DBLP DOI BibTeX RDF
30	Nabil H. Mustafa, Saurabh Ray	Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.	Comput. Geom.	2008	DBLP DOI BibTeX RDF
30	Muhammad Akram	(epsilon, epsilon ^ q)-Fuzzy ideals of K-algebras.	Ars Comb.	2008	DBLP BibTeX RDF
30	Min Zhang 0010, Wenjian Luo, Xingxin Pei, Xufa Wang	The self-adaption strategy for parameter epsilon in epsilon-MOEA.	IEEE Congress on Evolutionary Computation	2008	DBLP DOI BibTeX RDF
30	Bijan Davvaz	(epsilon, epsilon v q)-fuzzy subnear-rings and ideals.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 16Y30, 03E72, 16Y99
30	Tetsuyuki Takahama, Setsuko Sakai	Constrained Optimization by epsilon Constrained Particle Swarm Optimizer with epsilon-level Control.	WSTST	2005	DBLP DOI BibTeX RDF
30	Alexander Kovalenkov, Myrna Holtz Wooders	An Exact Bound on Epsilon for Nonemptiness of Epsilon Cores of Games.	Math. Oper. Res.	2001	DBLP DOI BibTeX RDF
30	James T. Kwok	Linear Dependency between epsilon and the Input Noise in epsilon-Support Vector Regression.	ICANN	2001	DBLP DOI BibTeX RDF
30	Stefan Sujan	Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources.	Kybernetika	1980	DBLP BibTeX RDF
25	Jennifer M. Davoren	Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces.	HSCC	2009	DBLP DOI BibTeX RDF
25	Carlos Alzate, Johan A. K. Suykens	Kernel Component Analysis Using an Epsilon-Insensitive Robust Loss Function.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
25	Ramesh Raskar	Computational Photography: Epsilon to Coded Photography.	ETVC	2008	DBLP DOI BibTeX RDF	Fourier optics, Optical heterodyning, Coded aperture imaging, digital refocusing, plenoptic camera, Fourier transform, Digital photography
25	Xilong Che, Liang Hu 0001	Parallel Multidimensional Step search algorithm for epsilon-insensitive support vector regression in time series prediction.	IJCNN	2008	DBLP DOI BibTeX RDF
25	Louis M. Rose, Richard F. Paige, Dimitrios S. Kolovos, Fiona Polack	The Epsilon Generation Language.	ECMDA-FA	2008	DBLP DOI BibTeX RDF
25	Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack	Merging Models with the Epsilon Merging Language (EML).	MoDELS	2006	DBLP DOI BibTeX RDF
25	Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack	The Epsilon Object Language (EOL).	ECMDA-FA	2006	DBLP DOI BibTeX RDF
25	Adam Ouorou	Epsilon-proximal decomposition method.	Math. Program.	2004	DBLP DOI BibTeX RDF	proximal point algorithms, large-scale programming, decomposition, convex optimization, multicommodity flows, cutting planes
25	Toshiyasu Arai	Epsilon substitution method for theories of jump hierarchies.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
25	Claus-Peter Wirth	A New Indefinite Semantics for Hilbert's Epsilon.	TABLEAUX	2002	DBLP DOI BibTeX RDF
25	Christian Böhm 0001, Bernhard Braunmüller, Florian Krebs, Hans-Peter Kriegel	Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data.	SIGMOD Conference	2001	DBLP DOI BibTeX RDF	data mining, knowledge discovery, similarity search, high-dimensional space, similarity join, feature transformation
25	Michael Beeson	Automatic Generation of Epsilon-Delta Proofs of Continuity.	AISC	1998	DBLP DOI BibTeX RDF
25	Luis A. Trejo, Carlos Sandoval	Improving Back-Propagation: Epsilon-Back-Propagation.	IWANN	1995	DBLP DOI BibTeX RDF
25	Dominique Michelucci	An epsilon-Arithmetic for Removing Degeneracies.	IEEE Symposium on Computer Arithmetic	1995	DBLP DOI BibTeX RDF
21	Zhi-Zhong Chen, Lusheng Wang 0001	Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	approximation algorithms, Computational biology
21	Travis Gagie, Marek Karpinski, Yakov Nekrich	Low-Memory Adaptive Prefix Coding.	DCC	2009	DBLP DOI BibTeX RDF
21	Sebastian Nowozin, Koji Tsuda	Frequent Subgraph Retrieval in Geometric Graph Databases.	ICDM	2008	DBLP DOI BibTeX RDF
21	Dragana Veljkovic, Kay A. Robbins	Force Feature Spaces for Visualization and Classification.	ICMLA	2008	DBLP DOI BibTeX RDF
21	Grant Schoenebeck	Linear Level Lasserre Lower Bounds for Certain k-CSPs.	FOCS	2008	DBLP DOI BibTeX RDF
21	Glencora Borradaile, Philip N. Klein, Claire Mathieu	A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.	FOCS	2008	DBLP DOI BibTeX RDF
21	Yefim Dinitz, Michael Elkin, Shay Solomon	Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.	FOCS	2008	DBLP DOI BibTeX RDF
21	Deeparnab Chakrabarty, Gagan Goel	On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP.	FOCS	2008	DBLP DOI BibTeX RDF
21	Dimitris Achlioptas, Amin Coja-Oghlan	Algorithmic Barriers from Phase Transitions.	FOCS	2008	DBLP DOI BibTeX RDF
21	Paul Beame, Dang-Trinh Huynh-Ngoc	On the Value of Multiple Read/Write Streams for Approximating Frequency Moments.	FOCS	2008	DBLP DOI BibTeX RDF
21	Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack	Detecting and Repairing Inconsistencies across Heterogeneous Models.	ICST	2008	DBLP DOI BibTeX RDF	Model Driven Development, Inconsistency Management, Model Consistency
21	Supasit Monpratarnchai, Tetsuo Tamai	The Implementation and Execution Framework of a Role Model Based Language, EpsilonJ.	SNPD	2008	DBLP DOI BibTeX RDF	Collaboration, Adaptation, Object, Role
21	Errol L. Lloyd, Guoliang Xue	Relay Node Placement in Wireless Sensor Networks.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	wireless sensor networks, approximation algorithms, Relay node placement
21	Srikanth Gottipati, Anil Nerode	A Synthesis Algorithm for Hybrid Systems.	LFCS	2007	DBLP DOI BibTeX RDF
21	C. He, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov	Joint Permutor Analysis and Design for Multiple Turbo Codes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	Venkatesan Guruswami, Atri Rudra	Limits to List Decoding Reed-Solomon Codes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, Habong Chung	New Design of Low-Correlation Zone Sequence Sets.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	Nikhil Bansal 0001, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha	Non-Clairvoyant Scheduling for Minimizing Mean Slowdown.	Algorithmica	2004	DBLP DOI BibTeX RDF	Non-clairvoyant algorithms, Resourcelinebreak[4] augmentation, Scheduling, Online algorithms, Slowdown
21	Alex Iosevich, Izabella Laba	Distance Sets of Well-Distributed Planar Point Sets.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
21	Rajeev Raman, S. Srinivasa Rao 0001	Succinct Dynamic Dictionaries and Trees.	ICALP	2003	DBLP DOI BibTeX RDF
21	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.	ICALP	2003	DBLP DOI BibTeX RDF
21	Amitava Datta, Subbiah Soundaralakshmi, Robyn A. Owens	Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	reconfigurable bus, pipelined communication, merging, sorting algorithm, optical bus, deterministic sampling
21	Markus Bläser, Bodo Manthey	Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint.	ISAAC	2002	DBLP DOI BibTeX RDF
21	Ari Freund 0001, Joseph Naor	Approximating the Advertisement Placement Problem.	IPCO	2002	DBLP DOI BibTeX RDF
21	Constantine Bekas, Effrosini Kokiopoulou, Efstratios Gallopoulos, Valeria Simoncini	Parallel Computation of Pseudospectra Using Transfer Functions on a MATLAB-MPI Cluster Platform.	PVM/MPI	2002	DBLP DOI BibTeX RDF
21	Pankaj K. Agarwal, Jie Gao 0001, Leonidas J. Guibas	Kinetic Medians and kd-Trees.	ESA	2002	DBLP DOI BibTeX RDF
21	Danny Z. Chen, Michiel H. M. Smid, Bin Xu 0009	Geometric Algorithms for Density-Based Data Clustering.	ESA	2002	DBLP DOI BibTeX RDF
21	Lars Engebretsen, Jonas Holmerin, Alexander Russell	Inapproximability Results for Equations over Finite Groups.	ICALP	2002	DBLP DOI BibTeX RDF
21	V. S. Anil Kumar 0001, Madhav V. Marathe	Improved Results for Stackelberg Scheduling Strategies.	ICALP	2002	DBLP DOI BibTeX RDF
21	Noam Nisan	The Communication Complexity of Approximate Set Packing and Covering.	ICALP	2002	DBLP DOI BibTeX RDF
21	Jonas Holmerin	Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs.	ICALP	2002	DBLP DOI BibTeX RDF
21	Alexandre Tiskin	Parallel Convex Hull Computation by Generalised Regular Sampling.	Euro-Par	2002	DBLP DOI BibTeX RDF
21	Mart de Graaf, Ronald de Wolf	On Quantum Versions of the Yao Principle.	STACS	2002	DBLP DOI BibTeX RDF
21	Aduri Pavan, Alan L. Selman	Bi-Immunity Separates Strong NP-Completeness Notions.	STACS	2002	DBLP DOI BibTeX RDF
21	Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha	Approximation Algorithms for Edge-Dilation k-Center Problems.	SWAT	2002	DBLP DOI BibTeX RDF
21	Stephan J. Eidenbenz	Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.	SWAT	2002	DBLP DOI BibTeX RDF
21	Nader H. Bshouty, Lynn Burroughs	On the Proper Learning of Axis Parallel Concepts.	COLT	2002	DBLP DOI BibTeX RDF
21	Hsueh-I Lu	Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees.	COCOON	2002	DBLP DOI BibTeX RDF
21	S. Mishra, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian	On the Hardness of Approximating Minimum Monopoly Problems.	FSTTCS	2002	DBLP DOI BibTeX RDF
21	Ran Raz	Resolution Lower Bounds for the Weak Pigeonhole Principle.	CCC	2002	DBLP DOI BibTeX RDF
21	Chi-Jen Lu	Derandomizing Arthur-Merlin games under uniform assumptions.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	graph nonisomorphism problem, nondeterminism, Derandomization, uniformity, Arthur-Merlin games
21	Yi Pan 0001, Si-Qing Zheng, Keqin Li 0001, Hong Shen 0001	An Improved Generalization of Mesh-Connected Computers with Multiple Buses.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	mesh-connected computer with multiple buses, parallel algorithm, parallel computing, parallel architecture, processor array, Bus, mesh-connected computer
21	Véronique Ventos, Pierre Brézellec, Henry Soldano	Explicitly Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules.	LPNMR	2001	DBLP DOI BibTeX RDF
21	Andris Ambainis	A new protocol and lower bounds for quantum coin flipping.	STOC	2001	DBLP DOI BibTeX RDF
21	Antonio Corral, Joaquín Cañadas, Michael Vassilakopoulos	Processing Distance-Based Queries in Multidimensional Data Spaces Using R-trees.	Panhellenic Conference on Informatics	2001	DBLP DOI BibTeX RDF
21	Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni	Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Single hop distributed systems, minimum schedule length, scheduling, approximation algorithms, NP-completeness
21	Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda	Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.	ISAAC	2000	DBLP DOI BibTeX RDF
21	Klaus Jansen, Lorant Porkolab	Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.	ICALP	2000	DBLP DOI BibTeX RDF
21	Michael Krivelevich, Van H. Vu	Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.	ICALP	2000	DBLP DOI BibTeX RDF
21	Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro	Efficient Communication in Unknown Networks.	WG	2000	DBLP DOI BibTeX RDF
21	Edson Cáceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe	Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs.	WG	2000	DBLP DOI BibTeX RDF
21	Sanjeev Kumar Mishra, Palash Sarkar 0001	Symmetrically Private Information Retrieval.	INDOCRYPT	2000	DBLP DOI BibTeX RDF	Private Information retrieval (PIR), Symmetrically Private Information Retrieval (SPIR), Quadratic Residuacity Assumption (QRA), Cryptographic Protocols, Probabilistic Encryption
21	Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger	Caching for Web Searching.	SWAT	2000	DBLP DOI BibTeX RDF
21	Sung-Ryul Kim, Kunsoo Park	Efficient List Ranking Algorithms on Reconfigurable Mesh.	COCOON	2000	DBLP DOI BibTeX RDF
21	Pietro Parodi, Roberto Fontana	Efficient and flexible text extraction from document pages.	Int. J. Document Anal. Recognit.	1999	DBLP DOI BibTeX RDF	Segmentation accuracy, Computational complexity, Text extraction, Document segmentation