The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase computational complexity (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1964-1971 (15) 1972-1974 (17) 1975-1976 (20) 1977-1978 (21) 1979-1980 (21) 1981-1982 (30) 1983 (15) 1984-1985 (22) 1986 (21) 1987 (23) 1988 (47) 1989 (64) 1990 (85) 1991 (85) 1992 (97) 1993 (98) 1994 (185) 1995 (257) 1996 (202) 1997 (225) 1998 (203) 1999 (228) 2000 (319) 2001 (358) 2002 (338) 2003 (414) 2004 (549) 2005 (776) 2006 (902) 2007 (916) 2008 (956) 2009 (614) 2010 (367) 2011 (305) 2012 (306) 2013 (318) 2014 (318) 2015 (335) 2016 (336) 2017 (337) 2018 (348) 2019 (213)
Publication types (Num. hits)
article(6306) book(17) incollection(56) inproceedings(4860) phdthesis(34) proceedings(33)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8625 occurrences of 3563 keywords

Results
Found 11306 publication records. Showing 11306 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
45R. Elijah Blessing, V. Rhymend Uthariaraj Evaluation and Analysis of Computational Complexity for Secure Multicast Models. Search on Bibsonomy ICCSA (2) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF LeaSel, security, computational complexity, scalability, Multicast, encryptions, key distribution
39Liming Cai, Jianer Chen, Johan Håstad Circuit Bottom Fan-in and Computational Power. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF computational complexity, lower bound, circuit complexity, alternating Turing machine
38Jun (Jim) Xu, Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF quality of service, computational complexity, decision tree, packet scheduling, delay bound
38Jun (Jim) Xu, Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. Search on Bibsonomy SIGCOMM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality of service, computational complexity, decision tree, packet scheduling, delay bound
36Nageswara S. V. Rao Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1993 DBLP  DOI  BibTeX  RDF graph-based systems, alarm placement, fault propagation time, alarm placement problem, computational complexity, computational complexity, fault diagnosis, fault tolerant computing, NP-complete, fault propagation
36Mahdi Abdelguerfi, Arun K. Sood Computational Complexity of Sorting and Joining Relations with Duplicates. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality
35Gabriel Istrate Computational Complexity and Phase Transitions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices. Search on Bibsonomy RTCSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF secondary cells, power generation scheduling, power engineering computing, real time task scheduling algorithms, maximum utilization, secondary batteries, low power energy techniques, dynamic real time scheduling algorithms, secondary battery consumption, CPU frequency, real time scheduling algorithm, discrete frequency control, arbitrary frequency, real-time systems, computational complexity, computational complexity, NP-complete, portable devices, decision problem, portable computers, scheduling problem, task switching, real time tasks, amortized analysis, optimal scheduling algorithm, frequency control, frequency control
35Lance Fortnow The History of Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Computational Complexity, History of Computing
35Daniele Micciancio Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst-case/average-case connection, computational complexity, cryptography, hash functions, lattices
35Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
35Marcus Schaefer Deciding the K-Dimension is PSPACE-Complete. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF computational complexity, learning theory, PSPACE
35Jack Jie Dai, Jack H. Lutz Query Order and NP-Completeness. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF query order, resource-bounded genericity, computational complexity, NP-completeness, complexity classes, resource-bounded measure
35Klaus Ambos-Spies, Levke Bentzien Separating NP-Completeness Notions under Strong Hypotheses. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure
35László Babai, Peter G. Kimmel Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF randomized simultaneous messages, two-player communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra
35Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin Inequalities for Shannon entropies and Kolmogorov complexities. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF finite objects, Ingleton's inequality, Gacs-Korner's results, computational complexity, Kolmogorov complexities, Shannon entropies, linear inequalities
35Sanjeev Khanna, Madhu Sudan, Luca Trevisan Constraint Satisfaction: The Approximability of Minimization Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization
35Manindra Agrawal, Eric Allender, Samir Datta On TC0, AC0, and Arithmetic Circuits. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF TC/sup 0/, AC/sup 0/, function classes, constant-depth polynomial-size arithmetic circuits, unbounded fanin addition, multiplication gates, constant-depth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties
35Jack H. Lutz, Yong Zhao The Density of Weakly Complete Problems under Adaptive Reductions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resource-bounded measure
35Pierluigi Crescenzi A Short Guide to Approximation Preserving Reductions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF approximation preserving reductions, computational complexity, complexity, combinatorial optimization
35Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov Complexity and Expressive Power of Logic Programming. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF computational complexity, Logic programming, resolution, constraint logic programming, unification, expressive power
35Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer Nondeterministic NC1 Computation. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF nondeterministic Turing machine, leaf language, Computational complexity, circuit
35Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers Inverting Onto Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility
35Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer Complements of Multivalued Functions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy
35Helmut Veith Succinct Representation, Leaf Languages, and Projection Reductions. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF leaf languages, quantifier-free reductions, computational complexity, descriptive complexity, succinct representation
35Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney L-Printable Sets. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF printability, logspace, rankability, computational complexity
35Christos H. Papadimitriou The Complexity of Knowledge Representation. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, complexity, artificial intelligence, artificial intelligence, knowledge representation, knowledge representation, complexity theory, common-sense reasoning, common-sense reasoning
35Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay DNA Models and Algorithms for NP-complete Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF 3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
35Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik On Coherence, Random-self-reducibility, and Self-correction. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity
35Rainer Schuler Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, completeness, average-case analysis, resource-bounded measure
35Yongge Wang The Law of the Iterated Logarithm for p-Random Sequences. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF The law of the iterated logarithm, computational complexity, randomness
35Marcus Schäfer Deciding the Vapnik-Cervonenkis dimension is SigmaP3-complete. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity, VC dimension
35Ker-I Ko, Klaus Weihrauch On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines
35Dieter van Melkebeek Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF computational complexity theory, sparse hard set problem for P
35Noam Nisan Extracting Randomness: How and Why A survey. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Randmoness, Computational Complexity, Derandomization, Expanders
34Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson Measuring empirical computational complexity. Search on Bibsonomy ESEC/SIGSOFT FSE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF empirical computational complexity, trend-prof
32Arnold Beckmann A Note on Universal Measures for Weak Implicit Computational Complexity. Search on Bibsonomy LPAR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
32Danny Nguyen, Igor Pak The Computational Complexity of Integer Programming with Alternations. Search on Bibsonomy Computational Complexity Conference The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
32Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 09421 Abstracts Collection - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2009 DBLP  BibTeX  RDF
32Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 09421 Executive Summary - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2009 DBLP  BibTeX  RDF
32Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 08381 Executive Summary - Computational Complexity of Discrete Problems. Search on Bibsonomy Computational Complexity of Discrete Problems The full citation details ... 2008 DBLP  BibTeX  RDF
32Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 08381 Abstracts Collection - Computational Complexity of Discrete Problems. Search on Bibsonomy Computational Complexity of Discrete Problems The full citation details ... 2008 DBLP  BibTeX  RDF
32Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
32Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Executive Summary -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
32Harry Buhrman, Lance Fortnow, Thomas Thierauf 04421 Abstracts Collection - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2004 DBLP  BibTeX  RDF
32Syed Sajjad Rizvi, Aasia Riasat, Khaled M. Elleithy Transformation Matrix System for Reducing the Computational Complexity of Wireless Multi-User Receivers for DS-CDMA Systems. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiuser Communications, Computational Complexity, DS-CDMA, Transformation Matrix
31Ireneusz Karkowski Architectural synthesis with possibilistic programming. Search on Bibsonomy HICSS (1) The full citation details ... 1995 DBLP  DOI  BibTeX  RDF possibilistic programming, fuzzy mathematical programming, simultaneous scheduling, FOAS, computational complexity, computational complexity, fuzzy logic, high level synthesis, high-level synthesis, circuit CAD, mathematical programming, possibility theory
31Amir Averbuch, Samuel Itzikowitz, Tal Kapon Parallel Implementation of Multiple Model Tracking Algorithms. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF interacting multiple model algorithm, multiple model tracking, parallel algorithms, parallel algorithms, computational complexity, computational complexity, parallel implementation, MIMD, Viterbi algorithm, computerised signal processing
31Daniel Leivant Intrinsic Theories and Computational Complexity. Search on Bibsonomy LCC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Robert L. Constable Expressing Computational Complexity in Constructive Type Theory. Search on Bibsonomy LCC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
30Mahesh Mehendale, Sunil D. Sherlekar, G. Venkatesh Low power realization of FIR filters using multirate architectures. Search on Bibsonomy VLSI Design The full citation details ... 1996 DBLP  DOI  BibTeX  RDF low power realization, multirate architectures, computationally efficient implementations, power dissipation reduction, dedicated ASIC implementation, TMS320C2x/C5x programmable DSP, computational complexity, computational complexity, application specific integrated circuits, power analysis, digital filters, FIR filters, FIR filters, digital signal processing chips
30Gabriel Taubin Curve and Surface Smoothing without Shrinkage. Search on Bibsonomy ICCV The full citation details ... 1995 DBLP  DOI  BibTeX  RDF piecewise-linear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundary-following algorithms, iso-surface construction algorithms, piecewise linear shapes, linear low-pass filter, high curvature variations, required storage, computer vision, computational complexity, computational complexity, approximation algorithms, computational geometry, topology, image registration, medical image processing, data visualisation, curve fitting, edges, faces, vertices, smoothing methods, faceting, shrinkage, polyhedral surfaces, surface smoothing
30Tun-Wen Pai, John H. L. Hansen Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF boundary-constrained morphological skeleton minimization, boundary-constrained skeleton reconstruction, data storage requirement reduction, binary morphological skeleton, morphological boundary structure, computational complexity, computational complexity, image processing, image coding, image analysis, mathematical morphology
30Maria C. Yuang, Yu G. Chen, M. T. Yen Optimal multicast routing for ATM networks. Search on Bibsonomy LCN The full citation details ... 1995 DBLP  DOI  BibTeX  RDF optimal multicast routing algorithm, LOPT, load-sensitive networks, delay-sensitive, performance evaluation, computational complexity, computational complexity, asynchronous transfer mode, ATM networks, multicast routing, telecommunication network routing, multicast communication, delay bound
30Y. J. Bae, Michael C. Fairhurst Parallelism in dynamic time warping for automatic signature verification. Search on Bibsonomy ICDAR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF automatic signature verification, mathematical optimisation, sequentially structured problems, pipeline paradigm, highly distributed network, Meiko Computing Surface, Occam2, computational complexity, computational complexity, optimisation, handwriting recognition, time complexity, dynamic time warping, time warp simulation, transputer network
30Albert C. Chen, Chuan-lin Wu A Parallel Execution Model of Logic Programs. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF parallel execution model, nondeterministic logic program, frame inheritance, dynamic construction, computational complexity, computational complexity, logic programs, logic programming, modularity, communication channels, OR parallelism, AND parallelism, data-dependency graphs
30Gerald M. Karam, Raymond J. A. Buhr Temporal Logic-Based Deadlock Analysis For Ada. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
30Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf On Computation and Communication with Small Bias. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29André Berthiaume, Wim van Dam, Sophie Laplante Quantum Kolmogorov Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF data compression, information theory, quantum computation, Kolmogorov complexity, quantum information theory
29Suksan Jirachaweng, Teesid Leelasawassuk, Vutipong Areekul Performance and Computational Complexity Comparison of Block-Based Fingerprint Enhancement. Search on Bibsonomy ICB The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Fingerprint Enhancement, Fingerprint Enhancement Performance Comparison, Spatial-Domain/Frequency-Domain Fingerprint Enhancement, Fingerprint Enhancement Computational Complexity
29Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart The Computational Complexity of the Parallel Knock-Out Problem. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Parallel knock-out, computational complexity, graphs
29Predrag T. Tosic, Gul A. Agha On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. Search on Bibsonomy UC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, #P-completeness, computational complexity
29Robert Rettinger, Klaus Weihrauch The computational complexity of some julia sets. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF julia sets, computational complexity
29Evgeny Kaminsky, Dan Grois, Ofer Hadar Dynamic Computational Complexity and Bit Allocation for Optimizing H.264/AVC Video Compression. Search on Bibsonomy ITRE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Maria Grazia Albanesi, Alessandro Giancane Fast Retrieval on Compressed Images for Internet Applications. Search on Bibsonomy CAMP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF compressed images retrieval, content-based retrieval algorithm, digital image transform scheme, modified Wavelet multiresolution decomposition, multiresolution algorithm, index generation, YUV compressed JPEG images, Internet imaging, Internet, performance, computational complexity, computational complexity, feature extraction, indexing, visual data
28Kwok-Wai Cheung, Lai-Man Po Preprocessing for Discrete Multiwavelet Transform of Two-Dimensional Signals. Search on Bibsonomy ICIP (2) The full citation details ... 1997 DBLP  DOI  BibTeX  RDF discrete multiwavelet transform, two-dimensional signals, tree-structured matrix filter bank, vector sequence input, 2D approximation-based preprocessing scheme, energy compression ability, performance, computational complexity, computational complexity
28Bozidar Potocnik, Damjan Zazula, Danilo Korze Automated computer-assisted detection of follicles in ultrasound images of ovary. Search on Bibsonomy CBMS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF automated computer-assisted detection of follicles, ultrasound images of ovary, human reproduction, object recognition scheme, computational complexity, computational complexity, image segmentation, image classification, preprocessing
28Jian Chen, Valerie E. Taylor PART: a partitioning tool for efficient use of distributed systems. Search on Bibsonomy ASAP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF partitioning tool, geographically distributed supercomputers interconnection, decomposition tool, finite element based problems, performance, distributed systems, computational complexity, computational complexity, simulated annealing, wide area network, high-speed networks, execution time, processor performance, PART
28Steven Gold, Anand Rangarajan 0001 Graph matching by graduated assignment. Search on Bibsonomy CVPR The full citation details ... 1996 DBLP  DOI  BibTeX  RDF graduated assignment, graph matching energy function, weighted graph matching, attributed relational graph matching, computational complexity, computational complexity, graph theory, pattern matching, constraint satisfaction, graph matching, subgraph isomorphism, softassign
28Jean-Marc Laferté, Fabrice Heitz, Patrick Pérez, Eric Fabre Hierarchical Statistical Models for the Fusion of Multiresolution Image Data. Search on Bibsonomy ICCV The full citation details ... 1995 DBLP  DOI  BibTeX  RDF hierarchical statistical models, multiresolution image data fusion, nonlinear hierarchical algorithms, nonlinear causal Markov models, hierarchical graph structures, bayesian estimation theory, simple hierarchical graphs, ternary graphs, single-resolution image segmentation, computational complexity, computational complexity, image processing, image segmentation, graph theory, Markov processes, sensor fusion, optimal algorithm, Bayes methods, quadtrees, bayesian estimates, random processes, estimation theory, Viterbi algorithm, low-level vision, image size
28P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. Desai A multiresolution approach to color image restoration and parameter estimation using homotopy continuation method. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF multiresolution approach, color image restoration, homotopy continuation method, restoration algorithm, computational complexity, computational complexity, simulated annealing, parameter estimation, parameter estimation, Markov random field, Markov processes, image restoration, simulation results, image resolution, image colour analysis, random processes, energy function, MRF model, simulated annealing algorithm
28Nicos Herodotou, Anastasios N. Venetsanopoulos, Levent Onural Image interpolation using a simple Gibbs random field model. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF simple Gibbs random field model, downsampled version, image expansion, texture parameters, iterative GRF methods, noniterative nonlinear filtering operation, computational complexity, computational complexity, interpolation, iterative methods, estimation, image restoration, image texture, nonlinear filters, random processes, image sampling, image interpolation, spatial interpolation, image recovery
28Dam LeQuang, André Zaccarin, S. Caron Object-oriented coding using successive motion field segmentation and estimation. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF object oriented coding, successive motion field segmentation, block based motion compensation, moving object boundaries, object oriented video compression algorithms, motion compensated images, successive motion field estimation, object oriented coder, maximum a posteriori probability estimate, translational motion field, complex motion models, computational complexity, image segmentation, motion estimation, probability, data compression, image sequences, video coding, video coding, image matching, maximum likelihood estimation, motion compensation, simulation results, video sequences, pixels, image regions, bit rate reduction, two stage algorithm, translational motion, computational complexity reduction
28Sungyoung Lee, Hyungill Kim, Jongwon Lee A soft aperiodic task scheduling algorithm in dynamic-priority systems. Search on Bibsonomy RTCSA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF soft aperiodic task scheduling algorithm, dynamic-priority systems, joint scheduling, hard deadline periodic tasks, soft deadline aperiodic tasks, fixed-critical task indicating algorithm, deadlinewise preassignment table, computational complexity, computational complexity, processor scheduling
28Hamid K. Aghajan, Thomas Kailath SLIDE: Subspace-Based Line Detection. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF subspace-based line detection, direction-of-arrival estimation, sensor array processing, line parameter estimation, computational complexity, computational complexity, object recognition, edge detection, parameter estimation, Hough transform, curve fitting, 3D images, array signal processing, straight lines, signal representation, SLIDE, grey-scale images
28Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis Local Versus Nonlocal Computation of Length of Digitized Curves. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF nonlocal computation, length of digitized curves, inherent parallel computational complexity, digitization level, random tessellation, deterministic tessellation, parallel algorithms, computational complexity, image segmentation, image segmentation, parallel computation, computational geometry, local computation
28Xiaoping Hu 0004, Narendra Ahuja Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF point features, disparity constraints, intensity-based matching algorithm, heuristic tests, two-dimensional geometrical relationships, rigidity test, disparity test, epipolar line, indoor images, computational complexity, computational complexity, feature extraction, image sequences, geometry, geometric constraints, matching algorithm, rigidity constraints, feature detectors
28Michael Young, David L. Levine, Richard N. Taylor Comments on "Temporal Logic-Based Deadlock Analysis for Ada''. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF temporal logic-based deadlock analysis, axiomatic proof method, event-based models, computational complexity, computational complexity, Ada, Ada, temporal logic, concurrency control, nondeterminism, symbolic manipulation, symbol manipulation, state-based models
28S. J. Wan, S. K. Michael Wong A Partially Supervised Learning Algorithm for Linearly Separable Systems. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF partially supervised learning, linearly separable systems, computational complexity, computational complexity, learning (artificial intelligence), lower bound
28James S. Duncan, Thomas Birkhölzer Reinforcement of Linear Structure using Parametrized Relaxation Labeling. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF linear structure reinforcement, label strength, information suppression, neighbourhood influence biassing, bar reinforcement, line segment reinforcement, parametrized relaxation labeling, local evidence, orientation labels, sigmoidal thresholding function, noise-suppressed labelings, edge reinforcement, computational complexity, computational complexity, picture processing, convergence, thinning, noisy images
28Wesley W. Chu, Chi-Man Sit, Kin K. Leung Task Response Time For Real-Time Distributed Systems With Resource Contentions. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF task response times, extended queuing network model, module response times, weighted control-flow graph model, task response time, invocation rates, module assignments, real-time systems, computational complexity, computational complexity, graph theory, resource allocation, distributed processing, queueing theory, analytic model, simulation results, interprocessor communications, scheduling policies, resource contentions, decomposition technique, real-time distributed systems, submodels, distributed processing systems
28Yujiun P. Wang, Theodosios Pavlidis Optimal Correspondence of String Subsequences. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
28Ashok K. Goel 0001, Tom Bylander Computational Feasibility of Structured Matching. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF decision-making problems, pattern recognition, pattern recognition, computational complexity, computational complexity, knowledge engineering, knowledge engineering, hierarchical structure, structured matching
28Sakti Pramanik, David Vineyard Optimizing Join Queries in Distributed Databases. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF reduced cover set, acyclic query graph, partial order graph, minimum response time, optimization, computational complexity, computational complexity, graph theory, distributed databases, distributed database, distributed databases, optimisation, database theory, concurrent processing, join queries
28Francesco Bergadano, Attilio Giordana, Lorenza Saitta Automated Concept Acquisition in Noisy Environments. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF automated concept acquisition, learning methodology, discriminant descriptions, clusters, machine learning, pattern recognition, computational complexity, computational complexity, artificial intelligence, artificial intelligence, speech recognition, speech recognition, knowledge acquisition, knowledge engineering, knowledge engineering, learning systems, formal logic, graph structure, noisy environments
28Hiroshi Noborio, Shozo Fukuda, Suguru Arimoto Construction of the Octree Approximating a Three-Dimensional Object by Using Multiple Views. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF polyhedral cones, octree representation, polygonal contour, hierarchical description, resolution level, computational complexity, computational complexity, computerised picture processing, computerised pattern recognition, trees (mathematics), nodes, computerized pattern recognition, computerized picture processing, 3-D objects
28Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 The Complexity of the Covering Radius Problem on Lattices and Codes. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Rocco A. Servedio, Steven J. Gortler Quantum versus Classical Learnability. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
28Larry J. Stockmeyer, Dharmendra S. Modha Links Between Complexity Theory and Constrained Block Coding. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
28Thanh Minh Hoang, Thomas Thierauf The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
28Manolis Koubarakis, Spiros Skiadopoulos, Christos Tryfonopoulos Logic and Computational Complexity for Boolean Information Retrieval. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Boolean information retrieval, computational complexity, query languages, data models, satisfiability, proximity, entailment
28Jin-yi Cai, Hong Zhu Progress in Computational Complexity Theory. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms
28Jirí Fiala 0001, Daniël Paulusma The Computational Complexity of the Role Assignment Problem. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism
28Dan C. Marinescu, Yongchang Ji, Gabriela M. Marinescu Genetic Economy, Symmetry, and Computational Complexity for Atomic Virus Structure Determination. Search on Bibsonomy IPDPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF 3D atomic structure, parallel orientation, asymmetric particles, computational complexity, electron microscopy
28Emanuele Covino, Giovanni Pani, Salvatore Caporaso Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF time-space classes, elementary functions, implicit computational complexity
27Jan Krajícek A reduction of proof complexity to computational complexity for AC0[p] Frege systems. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
27Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
27 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  BibTeX  RDF
27Manindra Agrawal On Derandomizing Tests for Certain Polynomial Identities. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 11306 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license