|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1702 occurrences of 848 keywords
|
|
|
Results
Found 4049 publication records. Showing 4049 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono 0001 |
Drawing Borders Efficiently. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Algorithm, Approximation algorithm, Combinatorial optimization, NP-hardness, Spreadsheet |
14 | Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir Singh Sodhi |
Sequencing unreliable jobs on parallel machines. |
J. Sched. |
2009 |
DBLP DOI BibTeX RDF |
Indexable problems, Unsupervised manufacturing systems, Approximation algorithms, NP-hardness, Polymatroids |
14 | Shankar Kalyanaraman, Christopher Umans |
The Complexity of Rationalizing Network Formation. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
network formation games, Jackson-Wolinsky model, Inequality-SAT, hardness of approximation |
14 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu 0002 |
Agnostic Learning of Monomials by Halfspaces Is Hard. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Hardness of Learning, Dictatorship Tests, PCPs, Agnostic Learning |
14 | Iftach Haitner |
A Parallel Repetition Theorem for Any Interactive Argument. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
interactive arguments, computationally sound proofs, parallel repetition, hardness amplification |
14 | Prasad Raghavendra, David Steurer |
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
SDP hierarchies, Sherali-Adams hierarchy, integrality gap construction, approximation algorithms, semidefinite programming, hardness of approximation, unique games conjecture |
14 | Sébastien Vérel |
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary computation, network analysis, fitness landscapes, problem hardness |
14 | Bin Xin 0002, Jie Chen 0003, Feng Pan 0003 |
Problem difficulty analysis for particle swarm optimization: deception and modality. |
GEC Summit |
2009 |
DBLP DOI BibTeX RDF |
particle swarm optimization, global optimization, problem hardness |
14 | Baoqiang Fan, Rongjun Chen, Guochun Tang |
Bicriteria Scheduling on Single-Machine with Inventory Operations. |
COCOA |
2009 |
DBLP DOI BibTeX RDF |
bicriteria, scheduling, approximation algorithm, NP-hardness, performance ratio |
14 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
14 | Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta |
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Combinatorial auctions, Hardness of approximation, Social welfare, Submodular |
14 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
14 | Minzhu Xie, Jianxin Wang 0001 |
An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
SNP (single-nucleotide polymorphism), NP-hardness, Haplotype, Genotype, Parameterized algorithm |
14 | Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa |
Grasp and Delivery for Moving Objects on Broken Lines. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Grasp and delivery, MAXSNP-hardness, Approximation algorithm, Moving objects |
14 | Kate Smith-Miles |
Cross-disciplinary perspectives on meta-learning for algorithm selection. |
ACM Comput. Surv. |
2008 |
DBLP DOI BibTeX RDF |
dataset characterization, empirical hardness, landscape analysis, classification, combinatorial optimization, sorting, constraint satisfaction, forecasting, model selection, meta-learning, Algorithm selection |
14 | Guoli Ding, Li Feng 0001, Wenan Zang |
The complexity of recognizing linear systems with certain integrality properties. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Total dual integrality, NP-hardness, Linear system, Polyhedron |
14 | Marjan van den Akker 0001, Han Hoogeveen |
Minimizing the number of late jobs in a stochastic setting using a chance constraint. |
J. Sched. |
2008 |
DBLP DOI BibTeX RDF |
Number of late jobs, Stochastic processing times, Minimum success probability, Chance constraint, Scheduling, Dynamic programming, NP-hardness, Sequencing, Single machine |
14 | Ling Gai, Guochuan Zhang |
On lazy bureaucrat scheduling with common deadlines. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Sheduling, NP-hardness, Approximation scheme |
14 | Santiago Muelas, José María Peña Sánchez, Víctor Robles, Antonio LaTorre, P. de Miguel |
Machine Learning to Analyze Migration Parameters in Parallel Genetic Algorithms. |
Innovations in Hybrid Intelligent Systems |
2008 |
DBLP DOI BibTeX RDF |
migration parameters, migration topologies, optimization problem hardness, parallel genetic algorithms |
14 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu |
On the Approximability of Comparing Genomes with Duplicates. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness |
14 | Yerim Chung, Jean-François Culus, Marc Demange |
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
Inverse combinatorial optimization, Inverse chromatic number problem, Machine(s)-scheduling with earliness and or tardiness costs, Approximation, NP-hardness, Interval graphs |
14 | Minzhu Xie, Jianxin Wang 0001, Jianer Chen |
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
SNP (single-nucleotide polymorphism), MLF (Minimum Letter Flip), NP-hardness, haplotype, parameterized algorithm |
14 | Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff 0001 |
Optimizing active ranges for consistent dynamic map labeling. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
dynamic map labeling, approximation algorithms, np-hardness |
14 | Davide Bilò, Luca Forlizzi, Guido Proietti |
Approximating the Metric TSP in Linear Time. |
WG |
2008 |
DBLP DOI BibTeX RDF |
Metric Graphs, Linear-time Approximation Algorithms, NP-hardness, Traveling Salesman Problem |
14 | Zhenhua Li, Erik D. Goodman |
A practical search index and population size analysis based on the building block hypothesis. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
GA hardness, building block sampling, practical search index, genetic algorithm, building blocks, search space, population size |
14 | Minzhu Xie, Jianxin Wang 0001, Jianer Chen |
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC. |
BMEI (1) |
2008 |
DBLP DOI BibTeX RDF |
SNP (single-nucleotide polymorphism), MEC (Minimum Error Correction), NP-hardness, haplotype |
14 | 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 |
14 | Ryan O'Donnell, Yi Wu 0002 |
An optimal sdp algorithm for max-cut, and equally optimal long code tests. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
semidefinite programming, hardness of approximation, max-cut |
14 | Richard Matthew McCutchen |
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
one-sided preferences, popular matching, algorithms, matching, NP-hardness, voting |
14 | Erik D. Demaine, Robert A. Hearn |
Constraint Logic: A Uniform Framework for Modeling Computation as Games. |
CCC |
2008 |
DBLP DOI BibTeX RDF |
games, undecidability, hardness |
14 | Sun-Yuan Hsieh, Wen-Hao Pi |
On the Partial-Terminal Steiner Tree Problem. |
ISPAN |
2008 |
DBLP DOI BibTeX RDF |
The Steiner tree problem, the partial-terminal Steiner tree problem, approximation algorithms, MAX SNP-hardness |
14 | C. Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung, Louxin Zhang |
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem. |
IEEE ACM Trans. Comput. Biol. Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
parsimony method, dynamic programming, approximability, NP-hardness, combination network, phylogenetic network |
14 | Huiyu Luo, Gregory J. Pottie |
Designing routes for source coding with explicit side information in sensor networks. |
IEEE/ACM Trans. Netw. |
2007 |
DBLP DOI BibTeX RDF |
maximum weight branching, NP-hardness, source coding, Steiner tree, shortest path tree, data-centric routing |
14 | Thomas Eiter, Kazuhisa Makino |
On computing all abductive explanations from a propositional Horn theory. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Horn theories, dualization problem, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, propositional logic, tractability, prime implicates, characteristic set, enumeration algorithms |
14 | Adam Janiak, Tomasz Krysiak |
Single processor scheduling with job values depending on their completion times. |
J. Sched. |
2007 |
DBLP DOI BibTeX RDF |
Single processor, Job value, Heuristic, NP-hardness, Polynomial time |
14 | Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer |
Locating Facilities on a Network to Minimize Their Average Service Radius. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
Graph radius, Graph treewidth, NP-hardness, Graph partition, Facility location problems |
14 | Vadim V. Lozin, Martin Milanic |
Maximum independent sets in graphs of low degree. |
SODA |
2007 |
DBLP BibTeX RDF |
NP-hardness, polynomial-time algorithm, independent set |
14 | Luis Rademacher |
Approximating the centroid is hard. |
SCG |
2007 |
DBLP DOI BibTeX RDF |
approximation, completeness, centroid, hardness, convex body |
14 | Dominik Scheder, Philipp Zumstein |
Satisfiability with Exponential Families. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
polynomial circuits, NP-hardness, satisfiability, context-free grammars, VC-dimension |
14 | Stefan Porschen, Ewald Speckenmeyer |
Algorithms for Variable-Weighted 2-SAT and Dual Problems. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
weighted satisfiability, edge cover, graph factor, NP-hardness, optimization problem, perfect matching |
14 | Stefan Porschen |
Optimal Parameterized Rectangular Coverings. |
ICCSA (1) |
2007 |
DBLP DOI BibTeX RDF |
parameterized rectangular covering, integer grid, dynamic programming, NP-hardness, optimization problem, exact algorithmics, closure operator |
14 | Yannis Smaragdakis, Christoph Csallner, Ranjith Subramanian |
Scalable automatic test data generation from modeling diagrams. |
ASE |
2007 |
DBLP DOI BibTeX RDF |
ORM-modeling, test databases, NP-hardness, ORM |
14 | Venkatesan Guruswami, Prasad Raghavendra |
A 3-query PCP over integers. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
sparse linear equations, hardness of approximation, probabilistically checkable proofs, linearity testing |
14 | Zeev Nutov |
Approximating Rooted Connectivity Augmentation Problems. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Rooted connectivity, Augmentation problems, Approximation algorithms, Hardness of approximation |
14 | Gruia Calinescu, Peng-Jun Wan |
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. |
Mob. Networks Appl. |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, distributed algorithm, NP-hardness, topology control, power assignment |
14 | Rolf Klein, Martin Kutz |
Computing Geometric Minimum-Dilation Graphs Is NP-Hard. |
GD |
2006 |
DBLP DOI BibTeX RDF |
spanning ratio, NP-hardness, dilation, stretch factor, plane graph, geometric network |
14 | Thomas Moscibroda, Stefan Schmid 0001, Roger Wattenhofer |
On the topologies formed by selfish peers. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
network creation, game theory, NP-hardness |
14 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation |
14 | Shao Chin Sung, Milan Vlach |
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. |
J. Sched. |
2005 |
DBLP DOI BibTeX RDF |
just-in-time jobs, unrelated parallel machines, NP-hardness, polynomial time algorithm |
14 | Erich L. Kaltofen, Pascal Koiran |
On the complexity of factoring bivariate supersparse (Lacunary) polynomials. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
lacunary polynomials, NP-hardness, multivariate polynomials, polynomial-time complexity, polynomial factorizations, sparse polynomials |
14 | Uriel Feige, László Lovász 0001, Prasad Tetali |
Approximating Min Sum Set Cover. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Threshhold, NP-hardness, Greedy algorithm, Randomized rounding |
14 | Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta |
End-to-End Delay Heuristics for Adaptive Optical Wireless Networks. |
MASCOTS |
2004 |
DBLP DOI BibTeX RDF |
Optical Wireless Networks, Link Flexibility, NP-Hardness, Spanning Trees, Transmission Delay |
14 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
What cannot be computed locally! |
PODC |
2004 |
DBLP DOI BibTeX RDF |
approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching |
14 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation |
14 | Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe |
The geometric maximum traveling salesman problem. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
maximum scatter TSP, polyhedral metric, optimization, NP-hardness, Traveling salesman problem, polynomial time, Euclidean metric |
14 | Ming-Yang Kao, Jared Samet, Wing-Kin Sung |
The Enhanced Double Digest Problem for DNA Physical Mapping. |
J. Comb. Optim. |
2003 |
DBLP DOI BibTeX RDF |
DNA physical mapping, graph-theoretic techniques, NP-hardness, fast algorithms |
14 | Rajiv Gandhi, Srinivasan Parthasarathy 0002, Arunesh Mishra |
Minimizing broadcast latency and redundancy in ad hoc networks. |
MobiHoc |
2003 |
DBLP DOI BibTeX RDF |
ad hoc networks, approximation algorithms, broadcasting, NP-hardness |
14 | Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell |
Online dispersion algorithms for swarms of robots. |
SCG |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, NP-hardness, swarm robotics |
14 | Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell |
Touring a sequence of polygons. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
safari route, watchman route, shortest path, NP-hardness, traveling salesman problem, polygons |
14 | Esther M. Arkin, Michael A. Bender, Dongdong Ge |
Improved approximation algorithms for the freeze-tag problem. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization |
14 | Jeff Erickson 0001, Sariel Har-Peled |
Optimally cutting a surface into a disk. |
SCG |
2002 |
DBLP DOI BibTeX RDF |
cut graph, polygonal schema, polyhedral 2-manifold, approximation, NP-hardness, computational topology |
14 | Amotz Bar-Noy, Grzegorz Malewicz |
Establishing wireless conference calls under delay constraints. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
terminal paging, approximation algorithms, NP-hardness, convex optimization, location management, conference call |
14 | Guoling Shen, Takis Sakkalis, Nicholas M. Patrikalakis |
Analysis of boundary representation model rectification. |
Symposium on Solid Modeling and Applications |
2001 |
DBLP DOI BibTeX RDF |
CAD model defects, boundary reconstruction, robustness, NP-hardness, data exchange |
14 | Martin Skutella |
Approximating the single source unsplittable min-cost flow problem. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations |
14 | Moses Charikar, Venkatesan Guruswami, Ravi Kumar 0001, Sridhar Rajagopalan, Amit Sahai |
Combinatorial feature selection problems. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
combinatorial feature selection problems, multidimensional objects, subset size maximization, subset size minimization, p-center problem, hardness results, information retrieval, information retrieval, computational complexity, approximation algorithms, feature extraction, optimisation, set theory, VC-dimension, combinatorial mathematics, Vapnik-Chervonenkis dimension |
14 | Jan Johannsen |
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
feasible interpolation, cryptographic hardness assumption, function algebra, bounded arithmetic, implicit computational complexity, Diffie-Hellman problem |
14 | George Havas, Jean-Pierre Seifert |
The Complexity of the Extended GCD Problem. |
MFCS |
1999 |
DBLP DOI BibTeX RDF |
computational problems of diophantine equations, extended gcd computations, Approximation algorithms, NP-hardness, probabilistically checkable proofs, interactive proof systems |
14 | Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank |
Computing from Partial Solutions. |
CCC |
1999 |
DBLP DOI BibTeX RDF |
Robust proofs, erasure correction, erasure-resilient reductions, fault tolerant computations, NP-Hardness |
14 | Sanjeev Arora, Shmuel Safra |
Probabilistic Checking of Proofs: A New Characterization of NP. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
computations on polynomials and finite fields, proof checking, reducibility and completeness, trade-offs/relations among complexity measures, approximation algorithms, NP-completeness, error-correcting codes, hardness of approximations, probabilistic computation, interactive computation, complexity hierarchies |
14 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
Explicit OR-Dispersers with Polylogarithmic Degree. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
hashing lemmas, imperfect sources of randomness, measures of information, hardness of approximation, derandomization, expander graphs, time-space tradeoffs, pseudo-random generators, explicit constructions, randomized computation |
14 | Han Hoogeveen, Tsuyoshi Kawaguchi |
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
special cases, heuristics, NP-hardness, polynomial algorithms, worst-case analysis, total completion time, Flowshop |
14 | Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister |
Modifying Networks to Obtain Low Cost Trees. |
WG |
1996 |
DBLP DOI BibTeX RDF |
Computational Complexity, Approximation Algorithms, NP-hardness, Location Theory, Parametric Search |
14 | Moni Naor, Leonard J. Schulman, Aravind Srinivasan |
Splitters and Near-Optimal Derandomization. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing |
14 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability |
14 | Aravind Srinivasan, David Zuckerman |
Computing with Very Weak Random Sources |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
randomness-efficient Leftover Hash Lemma, very weak random sources, RP algorithms simulation, R-bit string, BPP simulations, Chor-Goldreich sources, expander constructions, probability, hardness, time-space tradeoffs, min-entropy |
14 | Carlo Meghini, Costantino Thanos |
The Complexity of Operations on a Fragmented Relation. |
ACM Trans. Database Syst. |
1991 |
DBLP DOI BibTeX RDF |
completeness of fragmentation schemas, relation fragmentation, query optimization, NP-hardness, updates |
14 | Jason S. J. Chen, Victor O. K. Li |
Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network. |
IEEE Trans. Software Eng. |
1989 |
DBLP DOI BibTeX RDF |
fragmented database systems, broadcast local network, minimum-weight vertex cover, join-analysis graph, parallelism, relational databases, distributed databases, concurrency control, redundancy, local area networks, NP hardness, relations |
11 | Julian Müllner, Marcel Moosbrugger, Laura Kovács |
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. |
Proc. ACM Program. Lang. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Yue Xu, Mansour Afzal |
Applying machine learning techniques in the form of ensemble and hybrid models to appraise hardness properties of high-performance concrete. |
J. Intell. Fuzzy Syst. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Pasin Manurangsi |
A note on hardness of computing recursive teaching dimension. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa |
On the hardness of inclusion-wise minimal separators enumeration. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier |
Equilibria in schelling games: computational hardness and robustness. |
Auton. Agents Multi Agent Syst. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Zexian Li, Chenglin Cai, Feng Yin, Wenhui Guan, Yun Fang |
Lightweight Segmentation Neural Networks for Measuring Vickers Hardness. |
IEEE Trans. Instrum. Meas. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Pegah Iranfar, Abdolah Amirany, Mohammad Hossein Moaiyeri, Kian Jafari |
On the Layout-Oriented Investigation of Power Attack Hardness of Spintronic-Based Logic Circuits. |
Circuits Syst. Signal Process. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Krijn Reijnders, Simona Samardjiska, Monika Trimoska |
Hardness estimates of the code equivalence problem in the rank metric. |
Des. Codes Cryptogr. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue |
Max-min greedy matching problem: Hardness for the adversary and fractional variant. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi |
Algorithms and hardness results for edge total domination problem in graphs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Shuichi Hirahara, Naoto Ohsaka |
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration. |
Electron. Colloquium Comput. Complex. |
2024 |
DBLP BibTeX RDF |
|
11 | Bruno Loff, Alexey Milovanov |
The hardness of decision tree complexity. |
Electron. Colloquium Comput. Complex. |
2024 |
DBLP BibTeX RDF |
|
11 | Dror Chawin, Ishay Haviv |
Hardness of Linear Index Coding on Perturbed Instances. |
IEEE Trans. Inf. Theory |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Paolo Santini, Marco Baldi, Franco Chiaraluce |
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems. |
IEEE Trans. Inf. Theory |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Shiyuan He, Jiwei Wei, Chaoning Zhang, Xing Xu 0001, Jingkuan Song, Yang Yang 0002, Heng Tao Shen |
Boosting Adversarial Training with Hardness-Guided Attack Strategy. |
IEEE Trans. Multim. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Yan Dai 0001, Beitao Chen, Lianli Gao, Jingkuan Song, Heng Tao Shen |
DMH-CL: Dynamic Model Hardness Based Curriculum Learning for Complex Pose Estimation. |
IEEE Trans. Multim. |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Maxim Buzdalov 0001, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid 0001 |
In the Search of Optimal Tree Networks: Hardness and Heuristics. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Hai-Xin Zhang, Dong Huang 0001 |
Deep Clustering with Diffused Sampling and Hardness-aware Self-distillation. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Stefan Tiegel |
Improved Hardness Results for Learning Intersections of Halfspaces. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Md Mahabub Uz Zaman, Liangde Tao, Mark Maldonado, Chang Liu, Ahmed Sunny, Shouhuai Xu, Lin Chen 0009 |
Optimally Blending Honeypots into Production Networks: Hardness and Algorithms. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Yimeng Min, Carla P. Gomes |
On Size and Hardness Generalization in Unsupervised Learning for the Travelling Salesman Problem. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Riwei Lai, Rui Chen, Qilong Han, Chi Zhang, Li Chen 0009 |
Adaptive Hardness Negative Sampling for Collaborative Filtering. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Markus Hecher, Rafael Kiesel |
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 4049 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|