Search results for "Approximation"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Nir Halman, Chung-Lun Li, David Simchi-Levi	Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	time-cost tradeoff, approximation algorithms, Project management
24	Wolfgang Hackbusch, Boris N. Khoromskij	Low-rank Kronecker-product Approximation to Multi-dimensional Nonlocal Operators. Part I. Separable Approximation of Multi-variate Functions.	Computing	2006	DBLP DOI BibTeX RDF	Kronecker tensor-product, sinc interpolation, sinc quadrature, approximation by exponential sums, Hierarchical matrices
22	Saeid Abbasbandy, E. Ahmady, Nazanin Ahmady	Triangular approximations of fuzzy numbers using alpha-weighted valuations.	Soft Comput.	2010	DBLP DOI BibTeX RDF	Fuzzy triangular approximation, Approximation, Fuzzy number
22	Clare A. McGrory, D. M. Titterington, R. Reeves, Anthony N. Pettitt	Variational Bayes for estimating the parameters of a hidden Potts model.	Stat. Comput.	2009	DBLP DOI BibTeX RDF	Potts/Ising model, Hidden Markov random field, Variational approximation, Pseudo-likelihood, Reduced dependence approximation, Bayesian inference
22	Sharon Marko, Dana Ron	Approximating the distance to properties in bounded-degree and general sparse graphs.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Sublinear approximation algorithms, property testing, graph properties, distance approximation
22	Tanmoy Chakraborty 0001, Julia Chuzhoy, Sanjeev Khanna	Network design for vertex connectivity.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, network design, hardness of approximation, vertex connectivity
22	Roberto Passerone, Jerry R. Burch, Alberto L. Sangiovanni-Vincentelli	Refinement preserving approximations for the design and verification of heterogeneous systems.	Formal Methods Syst. Des.	2007	DBLP DOI BibTeX RDF	Conservative approximation, Verification, Approximation, Reuse, Refinement, Refinement, Abstraction, Abstract interpretation, Heterogeneous, Polymorphism, Preserving, Model of computation, Galois connection, Discrete time, Continuous time, Concretization
22	Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev	Bi-criteria linear-time approximations for generalized k-mean/median/center.	SCG	2007	DBLP DOI BibTeX RDF	bi-criteria approximation, approximation, k-mean, geometric optimization, k-median, k-center
22	Baoqing Jiang, Keyun Qin, Zheng Pei 0001	On Transitive Uncertainty Mappings.	RSKT	2007	DBLP DOI BibTeX RDF	covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set
22	Zeev Nutov	Approximating Rooted Connectivity Augmentation Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Rooted connectivity, Augmentation problems, Approximation algorithms, Hardness of approximation
22	Oskar Mencer, Wayne Luk	Parameterized High Throughput Function Evaluation for FPGAs.	J. VLSI Signal Process.	2004	DBLP DOI BibTeX RDF	FPGAs, function approximation, CORDIC, lookup table, rational approximation
22	Oliver Kreylos, Bernd Hamann	On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data.	IEEE Trans. Vis. Comput. Graph.	2001	DBLP DOI BibTeX RDF	linear splines, multiresolution approximation, data-dependent triangulation, simulated annealing, Function approximation
22	Vladimir N. Temlyakov	Greedy algorithms in Banach spaces.	Adv. Comput. Math.	2001	DBLP DOI BibTeX RDF	convergence, greedy algorithm, nonlinear approximation, redundant systems, best approximation, Banach space
22	Raghu Pasupathy, Bruce W. Schmeiser	Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem.	ACM Trans. Model. Comput. Simul.	2009	DBLP DOI BibTeX RDF	Retrospective approximation, sample-average approximation, stochastic root finding
22	Refael Hassin, Jérôme Monnot, Danny Segev	Approximation algorithms and hardness results for labeled connectivity problems.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Labeled connectivity, Approximation algorithms, Hardness of approximation
22	Abhinandan Das, Johannes Gehrke, Mirek Riedewald	Semantic Approximation of Data Stream Joins.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	semantic load shedding, set approximation error metrics, approximation algorithms, Data streams, join processing
22	Shalabh Bhatnagar	Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization.	ACM Trans. Model. Comput. Simul.	2005	DBLP DOI BibTeX RDF	Adaptive three-timescale stochastic approximation algorithms, Newton-type algorithms, simultaneous perturbation stochastic approximation, simulation optimization
22	Shalabh Bhatnagar, I. Bala Bhaskar Reddy	Optimal Threshold Policies for Admission Control in Communication Networks via Discrete Parameter Stochastic Approximation.	Telecommun. Syst.	2005	DBLP DOI BibTeX RDF	regularized semi-Markov modulated Poisson process, two timescale stochastic approximation, simultaneous perturbation stochastic approximation, threshold type policies, admission control, communication networks
22	Leah Epstein, Jirí Sgall	Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.	Algorithmica	2004	DBLP DOI BibTeX RDF	Machine completion time, Scheduling, Approximation algorithms, Parallel machines, Polynomial time approximation scheme
22	Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani 0001, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas	Querying priced information in databases: The conjunctive case.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	online algorithms, Competitive analysis
22	Uriel Feige, Vahab S. Mirrokni, Jan Vondrák	Maximizing Non-Monotone Submodular Functions.	FOCS	2007	DBLP DOI BibTeX RDF
22	Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001	The Complexity of the Covering Radius Problem on Lattices and Codes.	CCC	2004	DBLP DOI BibTeX RDF
22	Chandra Chekuri, Sanjeev Khanna	Edge disjoint paths revisited.	SODA	2003	DBLP BibTeX RDF
22	Giorgio Ausiello, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela	On Salesmen, Repairmen, Spiders, and Other Traveling Agents.	CIAC	2000	DBLP DOI BibTeX RDF
22	Zbigniew M. Wójcik	Solving the Localization-Detection Trade-Off In Shadow Recognition Problem Using Rough Sets.	Rough Sets and Current Trends in Computing	2000	DBLP DOI BibTeX RDF
22	Jun Hu 0002, Guoyin Wang 0001	Knowledge Reduction of Covering Approximation Space.	Trans. Comput. Sci.	2009	DBLP DOI BibTeX RDF	rough sets, reduction, Covering, granule
22	Maria-Florina Balcan, Avrim Blum, Anupam Gupta 0001	Approximate clustering without the approximation.	SODA	2009	DBLP DOI BibTeX RDF
22	Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff	Improved Approximation Algorithms for Label Cover Problems.	ESA	2009	DBLP DOI BibTeX RDF
22	Chandra Chekuri, Iftah Gamzu	Truthful Mechanisms via Greedy Iterative Packing.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
22	Avner Magen, Mohammad Moharrami	Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
22	Gui-Bo Ye, Ding-Xuan Zhou	Learning and approximation by Gaussians on Riemannian manifolds.	Adv. Comput. Math.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68T05, 62J02
22	Vijay Victor D'Silva, Mitra Purandare, Daniel Kroening	Approximation Refinement for Interpolation-Based Model Checking.	VMCAI	2008	DBLP DOI BibTeX RDF
22	Brian C. Dean, Adam Griffis, Adam A. Whitley	Approximation Algorithms for k-Hurdle Problems.	LATIN	2008	DBLP DOI BibTeX RDF
22	Viswanath Nagarajan, R. Ravi 0001	The Directed Minimum Latency Problem.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
22	Damián Marelli	A Functional Analysis Approach to Subband System Approximation and Identification.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
22	Amos Beimel, Renen Hallak, Kobbi Nissim	Private Approximation of Clustering and Vertex Cover.	TCC	2007	DBLP DOI BibTeX RDF
22	Mahdi Abdelguerfi, Zhixiang Chen 0001, Bin Fu	On the Complexity of Approximation Streaming Algorithms for the k -Center Problem.	FAW	2007	DBLP DOI BibTeX RDF
22	Jianxin Wang 0001, Min Huang, Jianer Chen	A Lower Bound on Approximation Algorithms for the Closest Substring Problem.	COCOA	2007	DBLP DOI BibTeX RDF
22	Qinghua Hu, Daren Yu, Zongxia Xie, Jinfu Liu	Fuzzy Probabilistic Approximation Spaces and Their Information Measures.	IEEE Trans. Fuzzy Syst.	2006	DBLP DOI BibTeX RDF
22	Mykhaylo A. Teplechuk, John I. Sewell	The approximation of arbitrary complex filter responses.	ISCAS	2006	DBLP DOI BibTeX RDF
22	Asaf Levin	Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.	WAOA	2006	DBLP DOI BibTeX RDF
22	Alberto Guillén, Ignacio Rojas, Eduardo Ros 0001, Luis Javier Herrera	Using Fuzzy Clustering Technique for Function Approximation to Approximate ECG Signals.	IWINAC (2)	2005	DBLP DOI BibTeX RDF
22	Michael Krivelevich, Zeev Nutov, Raphael Yuster	Approximation algorithms for cycle packing problems.	SODA	2005	DBLP BibTeX RDF
22	Brian C. Dean, Michel X. Goemans, Jan Vondrák	Adaptivity and approximation for stochastic packing problems.	SODA	2005	DBLP BibTeX RDF
22	Rommel G. Regis, Christine A. Shoemaker	Local function approximation in evolutionary algorithms for the optimization of costly functions.	IEEE Trans. Evol. Comput.	2004	DBLP DOI BibTeX RDF
22	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
22	Artur Czumaj, Andrzej Lingas, Johan Nilsson	Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.	ISAAC	2003	DBLP DOI BibTeX RDF
22	Ju-Sheng Mi, Wei-Zhi Wu 0001, Wen-Xiu Zhang	Approaches to Approximation Reducts in Inconsistent Decision Tables.	RSFDGrC	2003	DBLP DOI BibTeX RDF
22	Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger	All-Norm Approximation Algorithms.	SWAT	2002	DBLP DOI BibTeX RDF
22	Michael Elkin, Guy Kortsarz	Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem.	STOC	2002	DBLP DOI BibTeX RDF
22	Lars Engebretsen, Venkatesan Guruswami	Is Constraint Satisfaction Over Two Variables Always Easy?	RANDOM	2002	DBLP DOI BibTeX RDF
22	Raymond M. Bryant, Anthony E. Krzesinski, Peter Teunissen	The MVA Pre-empt resume priority approximation.	SIGMETRICS	1983	DBLP DOI BibTeX RDF	Priority queueing networks, Error analysis, Mean value analysis, Approximate solutions, Product form solutions, Multiclass queueing networks
22	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
22	Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt	A Approximation Algorithm for the Minimum Maximal Matching Problem.	WAOA	2008	DBLP DOI BibTeX RDF
22	Viswanath Nagarajan, R. Ravi 0001	Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
22	Ning Chen 0005, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh	Improved Approximation Algorithms for the Spanning Star Forest Problem.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
22	Peter Schachte, Harald Søndergaard	Boolean Approximation Revisited.	SARA	2007	DBLP DOI BibTeX RDF
22	Alexander A. Ageev, Alexander V. Kononov	Approximation Algorithms for Scheduling Problems with Exact Delays.	WAOA	2006	DBLP DOI BibTeX RDF
22	Zeev Nutov	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian	Improved Algorithms for Data Migration.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Nikhil Bansal 0001, Don Coppersmith, Baruch Schieber	Minimizing Setup and Beam-On Times in Radiation Therapy.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.	FOCS	2003	DBLP DOI BibTeX RDF
22	Inge Li Gørtz, Anthony Wirth	Asymmetry in k-Center Variants.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
22	Yingyu Ye, Jiawei Zhang	An Improved Algorithm for Approximating the Radii of Point Sets.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
22	Susanne Albers, Carsten Witt	Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
22	Michel X. Goemans	Using Complex Semidefinite Programming for Approximating MAX E2-LIN3.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
22	Reuven Bar-Yehuda, Dror Rawitz	On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
22	John Dunagan, Santosh S. Vempala	On Euclidean Embeddings and Bandwidth Minimization.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
22	Sharon Marko, Dana Ron	Distance Approximation in Bounded-Degree and General Sparse Graphs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Chandra Chekuri, Martin Pál	An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
22	Viswanath Nagarajan, R. Ravi 0001	Approximation Algorithms for Requirement Cut on Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
22	Anupam Gupta 0001, Martin Pál, R. Ravi 0001, Amitabh Sinha	What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
22	Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko	A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.	RANDOM-APPROX	1999	DBLP DOI BibTeX RDF
22	Christine T. Cheng	A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings.	RANDOM-APPROX	1999	DBLP DOI BibTeX RDF
22	Hans Kellerer	A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.	RANDOM-APPROX	1999	DBLP DOI BibTeX RDF
22	Benjamin Doerr, Anand Srivastav	Approximation of Multi-color Discrepancy.	RANDOM-APPROX	1999	DBLP DOI BibTeX RDF
21	Adam Meyerson, Kamesh Munagala, Serge A. Plotkin	Cost-Distance: Two Metric Network Design.	FOCS	2000	DBLP DOI BibTeX RDF	cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis
21	Theodosios Pavlidis	Polygonal Approximations by Newton's Method.	IEEE Trans. Computers	1977	DBLP DOI BibTeX RDF	first-order splines, polygonal approximation of contours, polygonal approximation of waveforms, pattern recognition, Approximation theory
21	Rajiv Gandhi, Julián Mestre	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time.	Algorithmica	2009	DBLP DOI BibTeX RDF	Min-sum scheduling problems, Approximation algorithms, Primal-dual algorithms
21	Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos	Probabilistic graph-coloring in bipartite and split graphs.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Probabilistic optimization, Approximation algorithms, Graph coloring
21	Peng-Jun Wan	Multiflows in multihop wireless networks.	MobiHoc	2009	DBLP DOI BibTeX RDF	approximation algorithms, multicommodity flow, capacity region
21	Tobias Friedrich 0001, Christian Horoba, Frank Neumann 0001	Multiplicative approximations and the hypervolume indicator.	GECCO	2009	DBLP DOI BibTeX RDF	indicator-based algorithms, evolutionary algorithms, approximation, multi-objective optimization, hypervolume indicator
21	Jon Lee 0001, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko	Non-monotone submodular maximization under matroid and knapsack constraints.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, matroids, knapsacks, submodular functions
21	Elliot Anshelevich, Lisa Zhang	Path decomposition under a new cost measure with applications to optical network design.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Optical network design, path decomposition, approximation algorithms
21	Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag	Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Transitive reduction of directed graphs, Minimum equivalent digraph, (Biological) signal transduction networks, Approximation algorithms
21	Vahab S. Mirrokni, Michael Schapira, Jan Vondrák	Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions.	EC	2008	DBLP DOI BibTeX RDF	approximation algorithms, combinatorial auctions
21	Gruia Calinescu, Peng-Jun Wan	On Ring Grooming in optical networks.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Ring grooming, Approximation algorithms, Matching
21	Ron Lavi, Chaitanya Swamy	Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.	EC	2007	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, mechanism design
21	Errol L. Lloyd, Rui Liu 0001, S. S. Ravi	Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks.	Mob. Networks Appl.	2006	DBLP DOI BibTeX RDF	maximum power users, approximation algorithm, topology control, adhoc network
21	Wei-Zhi Wu 0001, You-Hong Xu	On Rough Fuzzy Set Algebras.	FSKD	2006	DBLP DOI BibTeX RDF	Rough fuzzy set algebras, Rough sets, Fuzzy sets, Approximation operators, Rough fuzzy sets
21	Yossi Azar, Amir Epstein	Convex programming for scheduling unrelated parallel machines.	STOC	2005	DBLP DOI BibTeX RDF	unrelated parallel machines, scheduling, approximation algorithms, randomized algorithms, convex programming
21	Ben-Jye Chang, Ren-Hung Hwang	Performance analysis for hierarchical multirate loss networks.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	private network to node interface (PNNI), performance analysis, hierarchical routing, loss networks, reduced load approximation
21	Hang Zhang, Jonathan E. Rowe	Best approximations of fitness functions of binary strings.	Nat. Comput.	2004	DBLP DOI BibTeX RDF	pseudo-boolean function, approximation, fitness function
21	Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners	On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	semidefiniteprogramming, Lovász -function, MAX-k-CUT, approximation algorithms, satisfiability, graph colouring
21	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	The all-or-nothing multicommodity flow problem.	STOC	2004	DBLP DOI BibTeX RDF	all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths
21	James F. Peters, Andrzej Skowron, Piotr Synak, Sheela Ramanna	Rough Sets and Information Granulation.	IFSA	2003	DBLP DOI BibTeX RDF	calculus of granules, rough sets, Approximation spaces, information granulation, rough mereology
21	Takao Asano	An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT.	FCT	2003	DBLP DOI BibTeX RDF	Approximation algorithm, LP-relaxation, MAX SAT
21	S. L. Lee, H.-J. Ho	Algorithms and Complexity for Weighted Hypergraph Embedding in a Cycle.	CW	2002	DBLP DOI BibTeX RDF	Approximation Algorithm, Parallel Computing, NP-Complete, LP-Relaxation
21	Thai B. Nguyen, B. John Oommen	Moment-Preserving Piecewise Linear Approximations of Signals and Images.	IEEE Trans. Pattern Anal. Mach. Intell.	1997	DBLP DOI BibTeX RDF	moment-preserving approximations, image processing, approximation, sampling, Signal processing
21	Charles B. Dunham	Minimax logarithmic error.	Commun. ACM	1969	DBLP DOI BibTeX RDF	logarithmic error, transformed rational approximation, square root