|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15492 occurrences of 5288 keywords
|
|
|
Results
Found 42681 publication records. Showing 42681 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Vid Petrovic, Falko Kuester |
Optimized Construction of Linear Approximations to Image Data. |
PG |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Adi Avidor, Uri Zwick |
Approximating MIN k-SAT. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Changhoon Lee, Deukjo Hong, Sungjae Lee, Sangjin Lee 0002, Hyungjin Yang, Jongin Lim 0001 |
A Chosen Plaintext Linear Attack on Block Cipher CIKS-1. |
ICICS |
2002 |
DBLP DOI BibTeX RDF |
CIKS-1(Cipher with Internal Key Scheduling), Block Cipher, Linear Cryptanalysis, Data-Dependent Permutation |
19 | William D. Clinger |
How to read floating point numbers accurately (with retrospective) |
Best of PLDI |
1990 |
DBLP DOI BibTeX RDF |
|
19 | William D. Clinger |
How to Read Floating-Point Numbers Accurately. |
PLDI |
1990 |
DBLP DOI BibTeX RDF |
|
19 | Awad H. Al-Mohy, Nicholas J. Higham |
The complex step approximation to the Fréchet derivative of a matrix function. |
Numer. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 15A60, 65F30 |
19 | Marcin Wolski |
Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators. |
Trans. Rough Sets |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Stefanie Jegelka, Suvrit Sra, Arindam Banerjee 0001 |
Approximation Algorithms for Tensor Clustering. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Robert Brummayer, Armin Biere |
Effective Bit-Width and Under-Approximation. |
EUROCAST |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Zeev Nutov |
Approximating Node-Connectivity Augmentation Problems. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Klaus Jansen, Hu Zhang 0004 |
Approximation algorithms for general packing problems and their application to the multicast congestion problem. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68W25, 90C25, 90C05, 68W40, 68M10 |
19 | Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi |
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem. |
IEEE Trans. Signal Process. |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Qian Huang 0003, King-Tim Ko, Villy Bæk Iversen |
Approximation of loss calculation for hierarchical networks with multiservice overflows. |
IEEE Trans. Commun. |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yinyin Liu, Janusz A. Starzyk, Zhen Zhu |
Optimized Approximation Algorithm in Neural Networks Without Overfitting. |
IEEE Trans. Neural Networks |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
Approximation algorithms for labeling hierarchical taxonomies. |
SODA |
2008 |
DBLP BibTeX RDF |
|
19 | Pavel Loskot, Norman C. Beaulieu |
Further Results on Prony Approximation for Evaluation of the Average Probability of Error. |
ICC |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Bo Wahlberg, Henrik Sandberg |
Cascade structural model approximation of identified state space models. |
CDC |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Feng Zou, Xianyue Li, Donghyun Kim 0001, Weili Wu 0001 |
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Yuval Lando, Zeev Nutov |
Inapproximability of Survivable Networks. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos |
Approximation algorithms for embedding general metrics into trees. |
SODA |
2007 |
DBLP BibTeX RDF |
|
19 | Manuel Lameiras Campagnolo, Kerry Ojakian |
Using Approximation to Relate Computational Classes over the Reals. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Gang Cheng 0003, Nirwan Ansari, Li Zhu |
Enhancing epsilon-Approximation Algorithms With the Optimal Linear Scaling Factor. |
IEEE Trans. Commun. |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Olivier Brun, Charles Bockstal, Jean-Marie Garcia |
Analytic approximation of the jitter incurred by CBR traffics in IP networks. |
Telecommun. Syst. |
2006 |
DBLP DOI BibTeX RDF |
GI + D/ GI + D/1 queue, CBR traffic, Internet, Delay-jitter |
19 | Mingen Lin, Yang Yang 0012, Jinhui Xu 0001 |
Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Amit Deshpande 0001, Luis Rademacher, Santosh S. Vempala, Grant Wang |
Matrix approximation and projective clustering via volume sampling. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Yaron Lipman, Daniel Cohen-Or, David Levin |
Error bounds and optimal neighborhoods for MLS approximation. |
Symposium on Geometry Processing |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Uffe Flarup Hansen, Klaus Meer |
Approximation Classes for Real Number Optimization Problems. |
UC |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio Salakoski |
Regular Approximation of Link Grammar. |
FinTAL |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Josep Domingo-Ferrer, Francesc Sebé |
Optimal Multivariate 2-Microaggregation for Microdata Protection: A 2-Approximation. |
Privacy in Statistical Databases |
2006 |
DBLP DOI BibTeX RDF |
Clustering, Privacy-preserving data mining, Statistical disclosure control, Statistical databases, Microaggregation |
19 | Weiyin Ma, Renjiang Zhang |
Efficient Piecewise Linear Approximation of Bézier Curves with Improved Sharp Error Bound. |
GMP |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Zhixiang Chen 0001, Richard H. Fowler, Bin Fu, Binhai Zhu |
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Xiaojing Huang 0001, Yunxin Li |
MMSE-optimal approximation of continuous-phase modulated signal as superposition of linearly modulated pulses. |
IEEE Trans. Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Laurent Condat, Dimitri Van De Ville, Thierry Blu |
Hexagonal versus orthogonal lattices: a new comparison using approximation theory. |
ICIP (3) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Martin Gairing, Burkhard Monien, Andreas Woclaw |
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Junhong Wang |
Rough Set Approximation Based on Dynamic Granulation. |
RSFDGrC (1) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Minkyoung Cho, David M. Mount |
Improved Approximation Bounds for Planar Point Pattern Matching. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Suhua Zheng, Xiaodong Liu, Fenglan Xiong |
The Comparative Study of Logical Operator Set and Its Corresponding General Fuzzy Rough Approximation Operator Set. |
FSKD (1) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
19 | László Babai, Daniel Stefankovic |
Simultaneous diophantine approximation with excluded primes. |
SODA |
2004 |
DBLP BibTeX RDF |
|
19 | Artur Czumaj, Christian Sohler |
Sublinear-Time Approximation for Clustering Via Random Sampling. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Raja Jothi, Balaji Raghavachari |
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Sergio Pozzi, Gianluca Della Vedova, Giancarlo Mauri |
An Explicit Upper Bound for the Approximation Ratio of the Maximum Gene Regulatory Network Problem. |
CMSB |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes |
Improved approximation results for the minimum energy broadcasting problem. |
DIALM-POMC |
2004 |
DBLP DOI BibTeX RDF |
ad hoc networks, broadcasting, energy conservation |
19 | Matthew J. Streeter, Lee A. Becker |
Automated Discovery of Numerical Approximation Formulae via Genetic Programming. |
Genet. Program. Evolvable Mach. |
2003 |
DBLP DOI BibTeX RDF |
genetic programming, approximations, Pareto optimality, symbolic regression |
19 | Li Deng 0001, Jasha Droppo, Alex Acero |
Recursive estimation of nonstationary noise using iterative stochastic approximation for robust speech recognition. |
IEEE Trans. Speech Audio Process. |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Meinolf Sellmann, Norbert Sensen, Larissa Timajev |
Multicommodity Flow Approximation Used for Exact Graph Partitioning. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Brian C. Dean, Michel X. Goemans |
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim |
Private approximation of NP-hard functions. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Artur Czumaj, Andrzej Lingas |
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Thomas Erlebach, Klaus Jansen |
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. |
WAE |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer |
Approximation Algorithms for Clustering to Minimize the Sum of Diameters. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Dirk Bongartz |
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem. |
SOFSEM |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Eran Halperin, Uri Zwick |
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Juraj Hromkovic |
Stability of Approximation Algorithms for Hard Optimization Problems. |
SOFSEM |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Chandra Chekuri, Michael A. Bender |
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Paul J. Schweitzer, Giuseppe Serazzi, Marco Broglia |
A Queue-Shift Approximation Technique for Product-Form Queueing. |
Computer Performance Evaluation (Tools) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Jordan Gergov |
Approximation Algorithms for Dynamic Storage Allocations. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Hartmut Klauck |
On the Hardness of Global and Local Approximation. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Michel X. Goemans, David P. Williamson |
A General Approximation Technique for Constrained Forest Problems. |
SODA |
1992 |
DBLP BibTeX RDF |
|
19 | Dorit S. Hochbaum, David B. Shmoys |
Using dual approximation algorithms for scheduling problems theoretical and practical results. |
J. ACM |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Tadeusz Czachórski, Tomasz Nycz, Ferhan Pekergin |
Transcient states analysis - diffusion approximation as an alternative to Markov models, fluid-flow approximation and simulation. |
ISCC |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh |
PASS Approximation. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam |
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Lukasz Kowalik, Marcin Mucha |
Deterministic 7/8-Approximation for the Metric Maximum TSP. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Hiroyuki Kuwahara, Chris J. Myers |
Production-Passage-Time Approximation: A New Approximation Method to Accelerate the Simulation Process of Enzymatic Reactions. |
RECOMB |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Alexander A. Ageev, Artem V. Pyatkin |
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Johan Håstad |
On the Approximation Resistance of a Random Predicate. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Viswanath Nagarajan, R. Ravi 0001 |
Minimum Vehicle Routing with a Common Deadline. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Anthony Man-Cho So, Jiawei Zhang 0006, Yinyu Ye 0001 |
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Alexandre Bouchard-Côté, Norm Ferns, Prakash Panangaden, Doina Precup |
An approximation algorithm for labelled Markov processes: towards realistic approximation. |
QEST |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Alexander A. Sherstov, Peter Stone |
Function Approximation via Tile Coding: Automating Parameter Choice. |
SARA |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Victor Chepoi, Karim Nouioua, Yann Vaxès |
A Rounding Algorithm for Approximating Minimum Manhattan Networks. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Uriel Feige, Kunal Talwar |
Approximating the Bandwidth of Caterpillars. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Sergio Cabello |
Approximation Algorithms for Spreading Points. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Moshe Babaioff, Liad Blumrosen |
Computationally-Feasible Truthful Auctions for Convex Bundles. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Zoya Svitkina, Éva Tardos |
Min-Max Multiway Cut. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Dariusz R. Kowalski, Andrzej Pelc |
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Michael Elkin, Guy Kortsarz |
Polylogarithmic Inapproximability of the Radio Broadcast Problem. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Chandra Chekuri, Amit Kumar 0001 |
Maximum Coverage Problem with Group Budget Constraints and Applications. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Alexander A. Ageev |
Improved Approximation Algorithms for Multilevel Facility Location Problems. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban |
A Tractable Query Cache by Approximation. |
SARA |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Kamal Jain, Mohammad Mahdian, Amin Saberi |
Approximating Market Equilibria. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Jittat Fakcharoenphol, Kunal Talwar |
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Alexander Hall, Katharina Langkau, Martin Skutella |
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Guy Even, Naveen Garg 0001, Jochen Könemann, R. Ravi 0001, Amitabh Sinha |
Covering Graphs Using Trees and Stars. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Luca Becchetti, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Kirk Pruhs |
Online Weighted Flow Time and Deadline Scheduling. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani |
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Petros Drineas, Michael W. Mahoney, S. Muthukrishnan 0001 |
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Jens Maßberg, Jens Vygen |
Approximation Algorithms for Network Design and Facility Location with Service Capacities. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Julián Mestre |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
|
|