|
|
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 |
18 | Sudipto Guha, Nick Koudas, Kyuseok Shim |
Approximation and streaming algorithms for histogram construction problems. |
ACM Trans. Database Syst. |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithm, Data Streams, histograms |
18 | Xiaofeng Gao 0003, Allan Snavely, Larry Carter |
Path Grammar Guided Trace Compression and Trace Approximation. |
HPDC |
2006 |
DBLP DOI BibTeX RDF |
path grammar guided trace compression, trace approximation, PGGTC, Sequitur algorithm, selective dumping, memory signature, parallel computer, computer architecture, parallel machine, trace-driven simulation, cache storage |
18 | Joachim Gehweiler, Christiane Lammersen, Christian Sohler |
A distributed O(1)-approximation algorithm for the uniform facility location problem. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
distributed approximation, randomized algorithm, facility location |
18 | Eugene Bodansky, Alexander Gribov |
Approximation of a Polyline with a Sequence of Geometric Primitives. |
ICIAR (2) |
2006 |
DBLP DOI BibTeX RDF |
Polygonal line, Straight segments, Free curves, Approximation, Compression, Recognition, Smoothing, Geometric primitives, Noise filtering, Polyline, Circular arcs |
18 | Sing-Ling Lee, Hann-Jang Ho |
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle. |
IEEE Trans. Parallel Distributed Syst. |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithm, NP-complete, integer linear programming, hypergraph, LP-relaxation |
18 | Olga Sorkine, Daniel Cohen-Or |
Geometry-Aware Bases for Shape Approximation. |
IEEE Trans. Vis. Comput. Graph. |
2005 |
DBLP DOI BibTeX RDF |
mesh Laplacian, Shape approximation, basis, linear least-squares |
18 | Yaochu Jin |
A comprehensive survey of fitness approximation in evolutionary computation. |
Soft Comput. |
2005 |
DBLP DOI BibTeX RDF |
Optimization, Evolutionary computation, Meta-model, Fitness approximation |
18 | Vitaly Maiorov |
On lower bounds in radial basis approximation. |
Adv. Comput. Math. |
2005 |
DBLP DOI BibTeX RDF |
radial basis function, Sobolev space, approximation order |
18 | Zhi-Zhong Chen, Lusheng Wang 0001 |
An Improved Randomized Approximation Algorithm for Max TSP. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
Max TSP, approximation algorithms, randomized algorithms, graph algorithms |
18 | Steffen Börm |
Approximation of Integral Operators by H2-Matrices with Adaptive Bases. |
Computing |
2005 |
DBLP DOI BibTeX RDF |
nested bases, Hierarchical matrices, data-sparse approximation |
18 | Yun Cui, Lusheng Wang 0001, Daming Zhu |
A 1.75-Approximation Algorithm for Unsigned Translocation Distance. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
Unsigned translocation distance, Approximation algorithm |
18 | Asif Masood, Muhammad Sarfraz 0001, Shaiq A. Haq |
Curve Approximation with Quadratic B-Splines. |
IV |
2005 |
DBLP DOI BibTeX RDF |
Curve approximation, Quadratic B-splines, Opening angle plot, Knots, Data Points |
18 | Atsushi Wada, Keiki Takadama, Katsunori Shimohara |
Learning classifier system equivalent with reinforcement learning with function approximation. |
GECCO Workshops |
2005 |
DBLP DOI BibTeX RDF |
reinforcement learning, learning classifier systems, function approximation, genetic-based machine learning |
18 | Thomas Moscibroda, Roger Wattenhofer |
Facility location: distributed approximation. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
distributed approximation, linear programming, facility location, primal-dual algorithms |
18 | Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer |
Local approximation schemes for ad hoc and sensor networks. |
DIALM-POMC |
2005 |
DBLP DOI BibTeX RDF |
distributed algorithm, approximation, wireless ad hoc networks, maximum independent set, minimum dominating set |
18 | Guang Xu, Jinhui Xu 0001 |
An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
Algorithms, Approximation Algorithms, Outliers, Facility Location Problem |
18 | Adriana Felicia Bumb, Jan-Kees C. W. van Ommeren |
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
stochastic facility location, approximation algorithms |
18 | Dave Waddington, Robin Thompson |
Using a correlated probit model approximation to estimate the variance for binary matched pairs. |
Stat. Comput. |
2004 |
DBLP DOI BibTeX RDF |
asymptotic bias, correlated probit model approximation, matched pairs, maximum likelihood, binary data |
18 | Adam Cannon, Lenore Cowen |
Approximation Algorithms for the Class Cover Problem. |
Ann. Math. Artif. Intell. |
2004 |
DBLP DOI BibTeX RDF |
disk cover, margin classifier, classification, approximation algorithms, set cover |
18 | Kamal Jain, Vijay V. Vazirani |
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Fault tolerance, Approximation algorithms, Linear programming, Facility location |
18 | Refael Hassin, R. Ravi 0001, F. Sibel Salman |
Approximation Algorithms for a Capacitated Network Design Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Routing flow, Capacity installation, Approximation algorithms, Network design |
18 | Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos |
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. |
J. Sched. |
2004 |
DBLP DOI BibTeX RDF |
total tardiness, scheduling, approximation |
18 | George Barmpalias |
Approximation Representations for ?2 Reals. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
2 reals, Approximation structure, Cuts of linear orderings, Representations |
18 | Viktor N. Konovalov, Dany Leviatan |
Free-knot Splines Approximation of s-monotone Functions. |
Adv. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
relative width, free-knot spline, order of approximation, single hidden layer perceptron model, shape preserving |
18 | Toshihiro Fujito |
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
covering integer program, approximation algorithm, combinatorial optimization, partial cover |
18 | John Fisher, John L. Lowther, Ching-Kuang Shene |
Curve and surface interpolation and approximation: knowledge unit and software tool. |
ITiCSE |
2004 |
DBLP DOI BibTeX RDF |
approximation, interpolation, b-splines |
18 | Rafael Escovar, Salvador Ortiz 0002, Roberto Suaya |
Mutual inductance extraction and the dipole approximation. |
ISPD |
2004 |
DBLP DOI BibTeX RDF |
mutual coupling, inductance, approximation methods, parasitic extraction, electromagnetic fields |
18 | Karl Meinke |
Automated black-box testing of functional correctness using function approximation. |
ISSTA |
2004 |
DBLP DOI BibTeX RDF |
formal specification, approximation, functional test, constraint solving, test coverage, black-box test, satisfiability problem |
18 | Anupam Gupta 0001, Martin Pál, R. Ravi 0001, Amitabh Sinha |
Boosted sampling: approximation algorithms for stochastic optimization. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
boosted sampling, approximation algorithms, stochastic optimization, cost sharing |
18 | Yao-Ting Huang, Kui Zhang, Ting Chen 0006, Kun-Mao Chao |
Approximation Algorithms for the Selection of Robust Tag SNPs. |
WABI |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, missing data, SNP, haplotype block |
18 | Sergio Cabello, Marc J. van Kreveld |
Approximation Algorithms for Aligning Points. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Point placement, Approximation algorithms, Cartography, Geometric optimization |
18 | Noriyuki Fujimoto, Kenichi Hagihara |
On Approximation of the Bulk Synchronous Task Scheduling Problem. |
IEEE Trans. Parallel Distributed Syst. |
2003 |
DBLP DOI BibTeX RDF |
software overhead, message packaging, bulk synchronous schedule, approximation, NP-complete, Task scheduling, distributed memory, fine grain, nonapproximability |
18 | Elif Akçali, Alper Üngör |
Approximation Algorithms for Degree-Constrained Bipartite Network Flow. |
ISCIS |
2003 |
DBLP DOI BibTeX RDF |
capacity allocation}, scheduling, Approximation algorithms, network flows |
18 | Andreas Baltz, Anand Srivastav |
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Integer programming, Multicast routing |
18 | Fabian Kuhn, Roger Wattenhofer |
Constant-time distributed dominating set approximation. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
Ad-Hoc Networks, Approximation Algorithms, Distributed Algorithms, Linear Programming, Dominating Sets |
18 | Klaus Jansen, Roberto Solis-Oba |
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. |
PPAM |
2003 |
DBLP DOI BibTeX RDF |
scheduling, Approximation algorithm, constraints, chains |
18 | Jianhua Gan, Shouli Yan, Jacob A. Abraham |
Design and modeling of a 16-bit 1.5MSPS successive approximation ADC with non-binary capacitor array. |
ACM Great Lakes Symposium on VLSI |
2003 |
DBLP DOI BibTeX RDF |
non-binary capacitor array, successive approximation, calibration, analog-to-digital converter |
18 | Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram |
Meet and merge: approximation algorithms for confluent flows. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
confluent flow, routing, approximation algorithms, randomization, network flow, multicommodity flow, rounding |
18 | Rafail Ostrovsky, Yuval Rabani |
Polynomial-time approximation schemes for geometric min-sum median clustering. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Clustering, high-dimensional data, polynomial-time approximation schemes |
18 | Anna Galluccio, Guido Proietti |
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
Edge-Connectivity Augmentation, Approximation Algorithms, Network Survivability |
18 | Renaud Lepère, Christophe Rapine |
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
Scheduling, approximation algorithm, makespan, performance guarantee, duplication, communication times |
18 | Paul C. Kainen, Vera Kurková, Andrew Vogt |
Continuity of Approximation by Neural Networks in Lp Spaces. |
Ann. Oper. Res. |
2001 |
DBLP DOI BibTeX RDF |
Chebyshev set, strictly convex space, boundedly compact, near best approximation, continuous selection |
18 | Kamal Jain, Vijay V. Vazirani |
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, Lagrangian relaxation, facility location problem, k-median problem |
18 | Hélio Lopes 0001, João Batista S. de Oliveira, Luiz Henrique de Figueiredo |
Robust Adaptive Approximation of Implicit Curves. |
SIBGRAPI |
2001 |
DBLP DOI BibTeX RDF |
geometric modeling, interval arithmetic, automatic differentiation, piecewise linear approximation |
18 | Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer |
A polynomial-time approximation scheme for base station positioning in UMTS networks. |
DIAL-M |
2001 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design |
18 | Les A. Piegl, Wayne Tiller |
Least-Squares B-Spline Curve Approximation with Arbitary End Derivatives. |
Eng. Comput. |
2000 |
DBLP BibTeX RDF |
Algorithms, B-splines, Curves and surfaces, Data approximation |
18 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-conquer approximation algorithms via spreading metrics. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement |
18 | Fred J. Hickernell, Henryk Wozniakowski |
Integration and approximation in arbitrary dimensions. |
Adv. Comput. Math. |
2000 |
DBLP DOI BibTeX RDF |
curse of dimension, multivariate integration, multivariate approximation, 65D05, 41A63, tractability, 41A05, 41A25 |
18 | Toni Prahasto, Sanjeev Bedi |
Optimization of Knots for the Multi Curve B-Spline Approximation. |
GMP |
2000 |
DBLP DOI BibTeX RDF |
B-spline approximation, compatible curves, knot optimization, constrained optimization, curve fitting |
18 | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein 0001, Maxim Sviridenko |
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
average weighted completion time, scheduling, algorithm, parallel machines, approximation scheme, release dates |
18 | Nobutaka Suzuki, Yoichirou Sato, Michiyoshi Hayase |
An Approximation Method for Extracting Typical Classes from Semistructured Data. |
DANTE |
1999 |
DBLP DOI BibTeX RDF |
schema extraction, approximation algorithm, semistructured data |
18 | Remco C. Veltkamp |
Hierarchical approximation and localization. |
Vis. Comput. |
1998 |
DBLP DOI BibTeX RDF |
Polygonal and polyhedral approximation, Hierarchical object representation, Bounding volumes |
18 | Ingo Schiermeyer |
Approximating Maximum Independent Set in k-Clique-Free Graphs. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set |
18 | Hervé Dedieu, A. Flanagan, A. Robert |
Stochastic Approximation Techniques and Circuits and Systems Associated Tools for Neural Network Optimization. |
IWANN |
1997 |
DBLP DOI BibTeX RDF |
Sequential Parameter Estimation, Sensitivity Theory, Artificial Neural Networks, Adaptive Systems, Stochastic Approximation |
18 | Peter Feldmann, Roland W. Freund |
Circuit noise evaluation by Padé approximation based model-reduction techniques. |
ICCAD |
1997 |
DBLP DOI BibTeX RDF |
Pade approximation, Lanczos process, circuit simulation, noise analysis, reduced-order modeling |
18 | Pierluigi Crescenzi |
A Short Guide to Approximation Preserving Reductions. |
CCC |
1997 |
DBLP DOI BibTeX RDF |
approximation preserving reductions, computational complexity, complexity, combinatorial optimization |
18 | Gabriel Taubin |
Estimating the Tensor of Curvature of a Surface from a Polyhedral Approximation. |
ICCV |
1995 |
DBLP DOI BibTeX RDF |
tensor of curvature, polyhedral approximation, principal curvature estimation, iso-surface construction algorithms, symmetric matrices, integral formulas, computer vision, computer vision, computational geometry, surface, eigenvalues, medical applications, tensors, eigenvectors, eigenvalues and eigenfunctions, polyhedral surface, matrix representation |
18 | Andrew Klapper, Mark Goresky |
Cryptanalysis Based on 2-Adic Rational Approximation. |
CRYPTO |
1995 |
DBLP DOI BibTeX RDF |
cryptanalysis, Binary sequences, rational approximation, feedback with carry shift registers, 2-adic numbers |
18 | Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis |
Linear Approximation of Shortest Superstrings. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
shortest common superstring, approximation algorithm |
18 | Chin-Shyurng Fahn, Jhing-Fa Wang, Jau-Yien Lee |
An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1989 |
DBLP DOI BibTeX RDF |
2D digitised curves, adaptive reduction, computational complexity, computerised picture processing, computerised picture processing, time complexity, critical points, piecewise linear approximation, square grid |
17 | Anna C. Gilbert, Yi Li 0002, Ely Porat, Martin J. Strauss |
Approximate sparse recovery: optimizing time and measurements. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
approximation, embedding, sketching, sublinear algorithms, sparse approximation |
17 | Matthew Andrews, Lisa Zhang |
Complexity of wavelength assignment in optical network optimization. |
IEEE/ACM Trans. Netw. |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, optical networking, hardness of approximation, routing and wavelength assignment |
17 | Kalyan Kuppuswamy, Daniel C. Lee 0001 |
An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks. |
IEEE/ACM Trans. Netw. |
2009 |
DBLP DOI BibTeX RDF |
knapsack approximation, multiclass fixed-point approximation, optical WDM networks, performance evaluation, blocking probability, loss networks |
17 | Fengmei Liang, Keming Xie |
Color Image Interpolation Combined with Rough Sets Theory. |
RSKT |
2008 |
DBLP DOI BibTeX RDF |
Rough sets, surface, image interpolation, indiscernibility, upper approximation, lower approximation |
17 | Mohammed Shahid Abdulla, Shalabh Bhatnagar |
Reinforcement Learning Based Algorithms for Average Cost Markov Decision Processes. |
Discret. Event Dyn. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Actor-critic algorithms, Two timescale stochastic approximation, Simultaneous perturbation stochastic approximation, Normalized Hadamard matrices, TD-learning, Reinforcement learning, Markov decision processes, Policy iteration |
17 | Joseph Cheriyan, Mohammad R. Salavatipour |
Packing element-disjoint steiner trees. |
ACM Trans. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing |
17 | Ming-Wen Shao, Hong-Zhi Yang, Shi-Qing Fan |
Set Approximations in Multi-level Conceptual Data. |
RSKT |
2007 |
DBLP DOI BibTeX RDF |
Rough sets, formal concept analysis, concept lattice, upper approximation, lower approximation |
17 | Claire Kenyon-Mathieu, Warren Schudy |
How to rank with few errors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Kemeny-Young rank aggregation, feedback arc set, max acyclic subgraph, tournament graphs, approximation algorithm, polynomial-time approximation scheme |
17 | Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin |
One sketch for all: fast algorithms for compressed sensing. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation, embedding, sketching, group testing, sublinear algorithms, sparse approximation |
17 | Shengjun Liu, Charlie C. L. Wang, Kin-Chuen Hui, Xiaogang Jin 0001, Hanli Zhao |
Ellipsoid-tree construction for solid objects. |
Symposium on Solid and Physical Modeling |
2007 |
DBLP DOI BibTeX RDF |
ellipsoid-tree, volume approximation, solid models, shape approximation, bounding volume hierarchy |
17 | David Rivest-Hénault, Mohamed Cheriet |
Image Segmentation Using Level Set and Local Linear Approximations. |
ICIAR |
2007 |
DBLP DOI BibTeX RDF |
variational segmentation method, region model, local linear approximation, smooth approximation, Level set |
17 | Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand |
Computing machine-efficient polynomial approximations. |
ACM Trans. Math. Softw. |
2006 |
DBLP DOI BibTeX RDF |
minimax approximation, linear programming, floating-point arithmetic, polytopes, Polynomial approximation, Chebyshev polynomials |
17 | Trevor Sweeting, Samer Kharroubi |
Application of a predictive distribution formula to Bayesian computation for incomplete data models. |
Stat. Comput. |
2005 |
DBLP DOI BibTeX RDF |
Laplace approximation, predictive distribution, simulation, importance sampling, missing data, latent variables, asymptotic approximation, Metropolis-Hastings, data augmentation, Bayesian computation |
17 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
17 | Subhash Khot |
Hardness of approximating the shortest vector problem in lattices. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms, cryptography, lattices, hardness of approximation, shortest vector problem |
17 | Martin V. Butz |
Kernel-based, ellipsoidal conditions in the real-valued XCS classifier system. |
GECCO |
2005 |
DBLP DOI BibTeX RDF |
piece-wise linear approximation, radial bases, learning classifier systems, XCS, function approximation, GAs |
17 | Orlando A. Carvajal, Frederick W. Chapman, Keith O. Geddes |
Hybrid symbolic-numeric integration in multiple dimensions via tensor-product series. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
Geddes series scheme, Geddes-Newton series expansions, approximation of functions, bilinear series, deconstruction/approximation/reconstruction technique (DART), multiple integration, splitting operator, tensor products, symbolic-numeric algorithms |
17 | Jochen Könemann, R. Ravi 0001 |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation |
17 | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup |
OPT versus LOAD in dynamic storage allocation. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, polynomial time approximation schemes, dynamic storage allocation |
17 | Xiang-Yang Li 0001, Liwu Liu, Peng-Jun Wan, Ophir Frieder |
Practical Traffic Grooming Scheme for Single-Hub SONET/WDM Rings. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
multiplexing equipment, demultiplexing equipment, practical traffic grooming, single-hub SONET/WDM rings, SONET/WDM networks, low rate tributary streams, SONET add/drop multiplexer, electronic multiplexing, electronic demultiplexing, tributary traffic patterns, minimal resource cost, BLSR/2, UPSR, optimal grooming, line speeds, computational complexity, approximation algorithms, network topology, NP-complete problem, wavelength division multiplexing, telecommunication traffic, approximation theory, ADM, SONET, optical fibre networks, nonuniform traffic |
17 | Bernd Hamann, Benjamin W. Jordan, David F. Wiley |
On a Construction of a Hierarchy of Best Linear Spline Approximations Using Repeated Bisection. |
IEEE Trans. Vis. Comput. Graph. |
1999 |
DBLP DOI BibTeX RDF |
linear spline, visualization, Approximation, triangulation, spline, unstructured grid, hierarchical representation, scattered data, bisection, multiresolution method, best approximation, grid generation |
17 | Carsten Rössner, Jean-Pierre Seifert |
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard. |
MFCS |
1996 |
DBLP DOI BibTeX RDF |
2-prover 1-round interactive proof-systems, computational complexity, approximation algorithm, NP-hard, probabilistically checkable proofs, Diophantine approximation |
17 | D. Talukdar, Raj Acharya |
Estimation of fractal dimension using alternating sequential filters. |
ICIP |
1995 |
DBLP DOI BibTeX RDF |
alternating sequential filters, fractal dimension estimation, morphological transformation, piecewise planar approximation, natural textured images, similarity measure, mathematical morphology, image representation, image representation, texture analysis, fractals, set theory, image texture, image resolution, image resolution, filtering theory, approximation theory, multiresolution representation, synthetic images, 2D image, noise robustness, image processing applications, two dimensional image, surface areas |
17 | Kim L. Boyer, Muhammad J. Mirza, Gopa Ganguly |
The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range Data. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1994 |
DBLP DOI BibTeX RDF |
robust sequential estimator, surface organization, autonomous statistically robust sequential function approximation, partially occluded surfaces, noisy outlier-ridden functional range data, sequential least squares, surface characterization techniques, surface hypotheses, noisy depth map, unknown 3-D scene, seed points, modified Akaike Information Criterion, prune stage, coincidental surface alignment, weighted voting scheme, 5/spl times/5 decision window, ambiguous point, majority consensus, image segmentation, information theory, decision theory, parameterization, function approximation, estimation theory, range data, parameter space |
17 | C. Roger Glassey, Sridhar Seshadri |
Transient flows in queueing systems via closure approximations. |
Queueing Syst. Theory Appl. |
1993 |
DBLP DOI BibTeX RDF |
Approximation of distributions, closure approximation, queueing network, transient analysis, sojourn time |
17 | Francis K. H. Quek, Ramesh C. Jain, Terry E. Weymouth |
An Abstraction-Based Approach to 3-D Pose Determination from Range Images. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1993 |
DBLP DOI BibTeX RDF |
cylindrical surfaces, Gaussian curvature sign-map descriptors, 3-D pose determination, abstraction-based paradigm, mean curvature sign-map descriptors, algebraic surface descriptions, biquadratic surfaces, cylinder approximation, parameter estimation, parameter estimation, image recognition, image recognition, range images, approximation theory, polynomial approximations, nonlinear regression, planar surfaces |
16 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Venkat Chandrasekaran, Michael B. Wakin, Dror Baron, Richard G. Baraniuk |
Representation and Compression of Multidimensional Piecewise Functions Using Surflets. |
IEEE Trans. Inf. Theory |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Dan Wang, Meng-Da Wu |
Binary fuzzy rough set model based on triangle modulus and its application to image processing. |
IEEE ICCI |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Parinya Chalermsook, Julia Chuzhoy |
Maximum independent set of rectangles. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-closure spanners. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein |
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Reid Andersen, Kumar Chellapilla |
Finding Dense Subgraphs with Size Bounds. |
WAW |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Václav Smídl, Anthony Quinn |
Variational Bayesian Filtering. |
IEEE Trans. Signal Process. |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Andrzej S. Murawski |
Reachability Games and Game Semantics: Comparing Nondeterministic Programs. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics |
16 | Zachary Friggstad, Mohammad R. Salavatipour |
Minimizing Movement in Mobile Facility Location Problems. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Pinyan Lu, Changyuan Yu |
Randomized Truthful Mechanisms for Scheduling Unrelated Machines. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko |
Finer Is Better: Abstraction Refinement for Rewriting Approximations. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Zeev Nutov |
Approximating Steiner Networks with Node Weights. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák |
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
|
|