

Venues (Conferences, Journals, ...)


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 
45  R. Elijah Blessing, V. Rhymend Uthariaraj 
Evaluation and Analysis of Computational Complexity for Secure Multicast Models. 
ICCSA (2) 
2003 
DBLP DOI BibTeX RDF 
LeaSel, security, computational complexity, scalability, Multicast, encryptions, key distribution 
39  Liming Cai, Jianer Chen, Johan Håstad 
Circuit Bottom Fanin and Computational Power. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
computational complexity, lower bound, circuit complexity, alternating Turing machine 
38  Jun (Jim) Xu, Richard J. Lipton 
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. 
IEEE/ACM Trans. Netw. 
2005 
DBLP DOI BibTeX RDF 
quality of service, computational complexity, decision tree, packet scheduling, delay bound 
38  Jun (Jim) Xu, Richard J. Lipton 
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. 
SIGCOMM 
2002 
DBLP DOI BibTeX RDF 
quality of service, computational complexity, decision tree, packet scheduling, delay bound 
36  Nageswara S. V. Rao 
Computational Complexity Issues in Operative Diagnosis of GraphBased Systems. 
IEEE Trans. Computers 
1993 
DBLP DOI BibTeX RDF 
graphbased systems, alarm placement, fault propagation time, alarm placement problem, computational complexity, computational complexity, fault diagnosis, fault tolerant computing, NPcomplete, fault propagation 
36  Mahdi Abdelguerfi, Arun K. Sood 
Computational Complexity of Sorting and Joining Relations with Duplicates. 
IEEE Trans. Knowl. Data Eng. 
1991 
DBLP DOI BibTeX RDF 
duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, threebranch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality 
35  Gabriel Istrate 
Computational Complexity and Phase Transitions. 
IEEE Conference on Computational Complexity 
2000 
DBLP DOI BibTeX RDF 

35  Xiaoming Sun, Andrew ChiChih Yao, Shengyu Zhang 
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? 
IEEE Conference on Computational Complexity 
2004 
DBLP DOI BibTeX RDF 

35  Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura 
Realtime task scheduling algorithms for maximum utilization of secondary batteries in portable devices. 
RTCSA 
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, realtime systems, computational complexity, computational complexity, NPcomplete, portable devices, decision problem, portable computers, scheduling problem, task switching, real time tasks, amortized analysis, optimal scheduling algorithm, frequency control, frequency control 
35  Lance Fortnow 
The History of Complexity. 
IEEE Conference on Computational Complexity 
2002 
DBLP DOI BibTeX RDF 
Computational Complexity, History of Computing 
35  Daniele Micciancio 
Improved Cryptographic Hash Functions with WorstCase/AverageCase Connection. 
IEEE Conference on Computational Complexity 
2002 
DBLP DOI BibTeX RDF 
worstcase/averagecase connection, computational complexity, cryptography, hash functions, lattices 
35  Beate Bollig, Martin Sauerhoff, Ingo Wegener 
On the NonApproximability of Boolean Functions by OBDDs and ReadKTimes Branching Programs. 
IEEE Conference on Computational Complexity 
2001 
DBLP DOI BibTeX RDF 
Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs 
35  Marcus Schaefer 
Deciding the KDimension is PSPACEComplete. 
IEEE Conference on Computational Complexity 
2000 
DBLP DOI BibTeX RDF 
computational complexity, learning theory, PSPACE 
35  Jack Jie Dai, Jack H. Lutz 
Query Order and NPCompleteness. 
IEEE Conference on Computational Complexity 
1999 
DBLP DOI BibTeX RDF 
query order, resourcebounded genericity, computational complexity, NPcompleteness, complexity classes, resourcebounded measure 
35  Klaus AmbosSpies, Levke Bentzien 
Separating NPCompleteness Notions under Strong Hypotheses. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
NPcompleteness notions separation, strong hypotheses, NPmcompleteness, NPTcompleteness, boundedquery reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure 
35  László Babai, Peter G. Kimmel 
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
randomized simultaneous messages, twoplayer communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra 
35  Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin 
Inequalities for Shannon entropies and Kolmogorov complexities. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
finite objects, Ingleton's inequality, GacsKorner's results, computational complexity, Kolmogorov complexities, Shannon entropies, linear inequalities 
35  Sanjeev Khanna, Madhu Sudan, Luca Trevisan 
Constraint Satisfaction: The Approximability of Minimization Problems. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization 
35  Manindra Agrawal, Eric Allender, Samir Datta 
On TC0, AC0, and Arithmetic Circuits. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
TC/sup 0/, AC/sup 0/, function classes, constantdepth polynomialsize arithmetic circuits, unbounded fanin addition, multiplication gates, constantdepth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties 
35  Jack H. Lutz, Yong Zhao 
The Density of Weakly Complete Problems under Adaptive Reductions. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
dense languages, polynomial reductions, sparse languages, weak completeness, computational complexity, complexity classes, resourcebounded measure 
35  Pierluigi Crescenzi 
A Short Guide to Approximation Preserving Reductions. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
approximation preserving reductions, computational complexity, complexity, combinatorial optimization 
35  Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov 
Complexity and Expressive Power of Logic Programming. 
IEEE Conference on Computational Complexity 
1997 
DBLP DOI BibTeX RDF 
computational complexity, Logic programming, resolution, constraint logic programming, unification, expressive power 
35  Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer 
Nondeterministic NC1 Computation. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
nondeterministic Turing machine, leaf language, Computational complexity, circuit 
35  Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers 
Inverting Onto Functions. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility 
35  Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer 
Complements of Multivalued Functions. 
IEEE Conference on Computational Complexity 
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 
35  Helmut Veith 
Succinct Representation, Leaf Languages, and Projection Reductions. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
leaf languages, quantifierfree reductions, computational complexity, descriptive complexity, succinct representation 
35  Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney 
LPrintable Sets. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
printability, logspace, rankability, computational complexity 
35  Christos H. Papadimitriou 
The Complexity of Knowledge Representation. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
computational complexity, complexity, artificial intelligence, artificial intelligence, knowledge representation, knowledge representation, complexity theory, commonsense reasoning, commonsense reasoning 
35  Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay 
DNA Models and Algorithms for NPcomplete Problems. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
3Sat, 3Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NPcomplete problems, search algorithms, NPhard problems 
35  Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik 
On Coherence, Randomselfreducibility, and Selfcorrection. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
selfcorrectability, randomselfreducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity 
35  Rainer Schuler 
Truthtable Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
computational complexity, completeness, averagecase analysis, resourcebounded measure 
35  Yongge Wang 
The Law of the Iterated Logarithm for pRandom Sequences. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
The law of the iterated logarithm, computational complexity, randomness 
35  Marcus Schäfer 
Deciding the VapnikCervonenkis dimension is SigmaP3complete. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
computational complexity, VC dimension 
35  KerI Ko, Klaus Weihrauch 
On the Measure of TwoDimensional Regions with PolynomialTime computables Boundaries. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
Lebesgue measure, twodimensional region, polynomialtime computable boundary, interior region, polynomialtime computable, computational complexity, computability, computability, Turing machines 
35  Dieter van Melkebeek 
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
computational complexity theory, sparse hard set problem for P 
35  Noam Nisan 
Extracting Randomness: How and Why A survey. 
IEEE Conference on Computational Complexity 
1996 
DBLP DOI BibTeX RDF 
Randmoness, Computational Complexity, Derandomization, Expanders 
34  Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson 
Measuring empirical computational complexity. 
ESEC/SIGSOFT FSE 
2007 
DBLP DOI BibTeX RDF 
empirical computational complexity, trendprof 
32  Arnold Beckmann 
A Note on Universal Measures for Weak Implicit Computational Complexity. 
LPAR 
2002 
DBLP DOI BibTeX RDF 
Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic 
32  Danny Nguyen, Igor Pak 
The Computational Complexity of Integer Programming with Alternations. 
Computational Complexity Conference 
2017 
DBLP DOI BibTeX RDF 

32  Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 
09421 Abstracts Collection  Algebraic Methods in Computational Complexity. 
Algebraic Methods in Computational Complexity 
2009 
DBLP BibTeX RDF 

32  Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans 
09421 Executive Summary  Algebraic Methods in Computational Complexity. 
Algebraic Methods in Computational Complexity 
2009 
DBLP BibTeX RDF 

32  Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 
08381 Executive Summary  Computational Complexity of Discrete Problems. 
Computational Complexity of Discrete Problems 
2008 
DBLP BibTeX RDF 

32  Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek 
08381 Abstracts Collection  Computational Complexity of Discrete Problems. 
Computational Complexity of Discrete Problems 
2008 
DBLP BibTeX RDF 

32  Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 
07411 Abstracts Collection  Algebraic Methods in Computational Complexity. 
Algebraic Methods in Computational Complexity 
2007 
DBLP BibTeX RDF 

32  Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 
07411 Executive Summary  Algebraic Methods in Computational Complexity. 
Algebraic Methods in Computational Complexity 
2007 
DBLP BibTeX RDF 

32  Harry Buhrman, Lance Fortnow, Thomas Thierauf 
04421 Abstracts Collection  Algebraic Methods in Computational Complexity. 
Algebraic Methods in Computational Complexity 
2004 
DBLP BibTeX RDF 

32  Syed Sajjad Rizvi, Aasia Riasat, Khaled M. Elleithy 
Transformation Matrix System for Reducing the Computational Complexity of Wireless MultiUser Receivers for DSCDMA Systems. 
ITNG 
2008 
DBLP DOI BibTeX RDF 
Multiuser Communications, Computational Complexity, DSCDMA, Transformation Matrix 
31  Ireneusz Karkowski 
Architectural synthesis with possibilistic programming. 
HICSS (1) 
1995 
DBLP DOI BibTeX RDF 
possibilistic programming, fuzzy mathematical programming, simultaneous scheduling, FOAS, computational complexity, computational complexity, fuzzy logic, high level synthesis, highlevel synthesis, circuit CAD, mathematical programming, possibility theory 
31  Amir Averbuch, Samuel Itzikowitz, Tal Kapon 
Parallel Implementation of Multiple Model Tracking Algorithms. 
IEEE Trans. Parallel Distrib. Syst. 
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 
31  Daniel Leivant 
Intrinsic Theories and Computational Complexity. 
LCC 
1994 
DBLP DOI BibTeX RDF 

31  Robert L. Constable 
Expressing Computational Complexity in Constructive Type Theory. 
LCC 
1994 
DBLP DOI BibTeX RDF 

30  Mahesh Mehendale, Sunil D. Sherlekar, G. Venkatesh 
Low power realization of FIR filters using multirate architectures. 
VLSI Design 
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 
30  Gabriel Taubin 
Curve and Surface Smoothing without Shrinkage. 
ICCV 
1995 
DBLP DOI BibTeX RDF 
piecewiselinear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundaryfollowing algorithms, isosurface construction algorithms, piecewise linear shapes, linear lowpass 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 
30  TunWen Pai, John H. L. Hansen 
BoundaryConstrained Morphological Skeleton Minimization and Skeleton Reconstruction. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1994 
DBLP DOI BibTeX RDF 
boundaryconstrained morphological skeleton minimization, boundaryconstrained skeleton reconstruction, data storage requirement reduction, binary morphological skeleton, morphological boundary structure, computational complexity, computational complexity, image processing, image coding, image analysis, mathematical morphology 
30  Maria C. Yuang, Yu G. Chen, M. T. Yen 
Optimal multicast routing for ATM networks. 
LCN 
1995 
DBLP DOI BibTeX RDF 
optimal multicast routing algorithm, LOPT, loadsensitive networks, delaysensitive, performance evaluation, computational complexity, computational complexity, asynchronous transfer mode, ATM networks, multicast routing, telecommunication network routing, multicast communication, delay bound 
30  Y. J. Bae, Michael C. Fairhurst 
Parallelism in dynamic time warping for automatic signature verification. 
ICDAR 
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 
30  Albert C. Chen, Chuanlin Wu 
A Parallel Execution Model of Logic Programs. 
IEEE Trans. Parallel Distrib. Syst. 
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, datadependency graphs 
30  Gerald M. Karam, Raymond J. A. Buhr 
Temporal LogicBased Deadlock Analysis For Ada. 
IEEE Trans. Software Eng. 
1991 
DBLP DOI BibTeX RDF 
temporal logicbased specification language, deadlock analyzer, Timebench, concurrent systemdesign environment, COL, lineartime temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlockfree, deadlock algorithm, finite systems, worstcase 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 
30  Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf 
On Computation and Communication with Small Bias. 
IEEE Conference on Computational Complexity 
2007 
DBLP DOI BibTeX RDF 

29  André Berthiaume, Wim van Dam, Sophie Laplante 
Quantum Kolmogorov Complexity. 
IEEE Conference on Computational Complexity 
2000 
DBLP DOI BibTeX RDF 
data compression, information theory, quantum computation, Kolmogorov complexity, quantum information theory 
29  Suksan Jirachaweng, Teesid Leelasawassuk, Vutipong Areekul 
Performance and Computational Complexity Comparison of BlockBased Fingerprint Enhancement. 
ICB 
2009 
DBLP DOI BibTeX RDF 
Fingerprint Enhancement, Fingerprint Enhancement Performance Comparison, SpatialDomain/FrequencyDomain Fingerprint Enhancement, Fingerprint Enhancement Computational Complexity 
29  Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart 
The Computational Complexity of the Parallel KnockOut Problem. 
LATIN 
2006 
DBLP DOI BibTeX RDF 
Parallel knockout, computational complexity, graphs 
29  Predrag T. Tosic, Gul A. Agha 
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. 
UC 
2005 
DBLP DOI BibTeX RDF 
Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, #Pcompleteness, computational complexity 
29  Robert Rettinger, Klaus Weihrauch 
The computational complexity of some julia sets. 
STOC 
2003 
DBLP DOI BibTeX RDF 
julia sets, computational complexity 
29  Evgeny Kaminsky, Dan Grois, Ofer Hadar 
Dynamic Computational Complexity and Bit Allocation for Optimizing H.264/AVC Video Compression. 
ITRE 
2006 
DBLP DOI BibTeX RDF 

28  Maria Grazia Albanesi, Alessandro Giancane 
Fast Retrieval on Compressed Images for Internet Applications. 
CAMP 
2000 
DBLP DOI BibTeX RDF 
compressed images retrieval, contentbased 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 
28  KwokWai Cheung, LaiMan Po 
Preprocessing for Discrete Multiwavelet Transform of TwoDimensional Signals. 
ICIP (2) 
1997 
DBLP DOI BibTeX RDF 
discrete multiwavelet transform, twodimensional signals, treestructured matrix filter bank, vector sequence input, 2D approximationbased preprocessing scheme, energy compression ability, performance, computational complexity, computational complexity 
28  Bozidar Potocnik, Damjan Zazula, Danilo Korze 
Automated computerassisted detection of follicles in ultrasound images of ovary. 
CBMS 
1997 
DBLP DOI BibTeX RDF 
automated computerassisted detection of follicles, ultrasound images of ovary, human reproduction, object recognition scheme, computational complexity, computational complexity, image segmentation, image classification, preprocessing 
28  Jian Chen, Valerie E. Taylor 
PART: a partitioning tool for efficient use of distributed systems. 
ASAP 
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, highspeed networks, execution time, processor performance, PART 
28  Steven Gold, Anand Rangarajan 0001 
Graph matching by graduated assignment. 
CVPR 
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 
28  JeanMarc Laferté, Fabrice Heitz, Patrick Pérez, Eric Fabre 
Hierarchical Statistical Models for the Fusion of Multiresolution Image Data. 
ICCV 
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, singleresolution 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, lowlevel vision, image size 
28  P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. Desai 
A multiresolution approach to color image restoration and parameter estimation using homotopy continuation method. 
ICIP 
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 
28  Nicos Herodotou, Anastasios N. Venetsanopoulos, Levent Onural 
Image interpolation using a simple Gibbs random field model. 
ICIP 
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 
28  Dam LeQuang, André Zaccarin, S. Caron 
Objectoriented coding using successive motion field segmentation and estimation. 
ICIP 
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 
28  Sungyoung Lee, Hyungill Kim, Jongwon Lee 
A soft aperiodic task scheduling algorithm in dynamicpriority systems. 
RTCSA 
1995 
DBLP DOI BibTeX RDF 
soft aperiodic task scheduling algorithm, dynamicpriority systems, joint scheduling, hard deadline periodic tasks, soft deadline aperiodic tasks, fixedcritical task indicating algorithm, deadlinewise preassignment table, computational complexity, computational complexity, processor scheduling 
28  Hamid K. Aghajan, Thomas Kailath 
SLIDE: SubspaceBased Line Detection. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1994 
DBLP DOI BibTeX RDF 
subspacebased line detection, directionofarrival 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, greyscale images 
28  Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis 
Local Versus Nonlocal Computation of Length of Digitized Curves. 
IEEE Trans. Pattern Anal. Mach. Intell. 
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 
28  Xiaoping Hu 0004, Narendra Ahuja 
Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1994 
DBLP DOI BibTeX RDF 
point features, disparity constraints, intensitybased matching algorithm, heuristic tests, twodimensional 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 
28  Michael Young, David L. Levine, Richard N. Taylor 
Comments on "Temporal LogicBased Deadlock Analysis for Ada''. 
IEEE Trans. Software Eng. 
1993 
DBLP DOI BibTeX RDF 
temporal logicbased deadlock analysis, axiomatic proof method, eventbased models, computational complexity, computational complexity, Ada, Ada, temporal logic, concurrency control, nondeterminism, symbolic manipulation, symbol manipulation, statebased models 
28  S. J. Wan, S. K. Michael Wong 
A Partially Supervised Learning Algorithm for Linearly Separable Systems. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1992 
DBLP DOI BibTeX RDF 
partially supervised learning, linearly separable systems, computational complexity, computational complexity, learning (artificial intelligence), lower bound 
28  James S. Duncan, Thomas Birkhölzer 
Reinforcement of Linear Structure using Parametrized Relaxation Labeling. 
IEEE Trans. Pattern Anal. Mach. Intell. 
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, noisesuppressed labelings, edge reinforcement, computational complexity, computational complexity, picture processing, convergence, thinning, noisy images 
28  Wesley W. Chu, ChiMan Sit, Kin K. Leung 
Task Response Time For RealTime Distributed Systems With Resource Contentions. 
IEEE Trans. Software Eng. 
1991 
DBLP DOI BibTeX RDF 
task response times, extended queuing network model, module response times, weighted controlflow graph model, task response time, invocation rates, module assignments, realtime 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, realtime distributed systems, submodels, distributed processing systems 
28  Yujiun P. Wang, Theodosios Pavlidis 
Optimal Correspondence of String Subsequences. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1990 
DBLP DOI BibTeX RDF 
stringtostring subsequence, stringtoregularexpression 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 barcode recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar 
28  Ashok K. Goel 0001, Tom Bylander 
Computational Feasibility of Structured Matching. 
IEEE Trans. Pattern Anal. Mach. Intell. 
1989 
DBLP DOI BibTeX RDF 
decisionmaking problems, pattern recognition, pattern recognition, computational complexity, computational complexity, knowledge engineering, knowledge engineering, hierarchical structure, structured matching 
28  Sakti Pramanik, David Vineyard 
Optimizing Join Queries in Distributed Databases. 
IEEE Trans. Software Eng. 
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 
28  Francesco Bergadano, Attilio Giordana, Lorenza Saitta 
Automated Concept Acquisition in Noisy Environments. 
IEEE Trans. Pattern Anal. Mach. Intell. 
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 
28  Hiroshi Noborio, Shozo Fukuda, Suguru Arimoto 
Construction of the Octree Approximating a ThreeDimensional Object by Using Multiple Views. 
IEEE Trans. Pattern Anal. Mach. Intell. 
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, 3D objects 
28  Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 
The Complexity of the Covering Radius Problem on Lattices and Codes. 
IEEE Conference on Computational Complexity 
2004 
DBLP DOI BibTeX RDF 

28  Rocco A. Servedio, Steven J. Gortler 
Quantum versus Classical Learnability. 
IEEE Conference on Computational Complexity 
2001 
DBLP DOI BibTeX RDF 

28  Larry J. Stockmeyer, Dharmendra S. Modha 
Links Between Complexity Theory and Constrained Block Coding. 
IEEE Conference on Computational Complexity 
2001 
DBLP DOI BibTeX RDF 

28  Thanh Minh Hoang, Thomas Thierauf 
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. 
IEEE Conference on Computational Complexity 
2000 
DBLP DOI BibTeX RDF 

28  Manolis Koubarakis, Spiros Skiadopoulos, Christos Tryfonopoulos 
Logic and Computational Complexity for Boolean Information Retrieval. 
IEEE Trans. Knowl. Data Eng. 
2006 
DBLP DOI BibTeX RDF 
Boolean information retrieval, computational complexity, query languages, data models, satisfiability, proximity, entailment 
28  Jinyi Cai, Hong Zhu 
Progress in Computational Complexity Theory. 
J. Comput. Sci. Technol. 
2005 
DBLP DOI BibTeX RDF 
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worstcase to averagecase reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms 
28  Jirí Fiala 0001, Daniël Paulusma 
The Computational Complexity of the Role Assignment Problem. 
ICALP 
2003 
DBLP DOI BibTeX RDF 
role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism 
28  Dan C. Marinescu, Yongchang Ji, Gabriela M. Marinescu 
Genetic Economy, Symmetry, and Computational Complexity for Atomic Virus Structure Determination. 
IPDPS 
2002 
DBLP DOI BibTeX RDF 
3D atomic structure, parallel orientation, asymmetric particles, computational complexity, electron microscopy 
28  Emanuele Covino, Giovanni Pani, Salvatore Caporaso 
Extending the Implicit Computational Complexity Approach to the Subelementary TimeSpace Classes. 
CIAC 
2000 
DBLP DOI BibTeX RDF 
timespace classes, elementary functions, implicit computational complexity 
27  Jan Krajícek 
A reduction of proof complexity to computational complexity for AC0[p] Frege systems. 
Electronic Colloquium on Computational Complexity (ECCC) 
2013 
DBLP BibTeX RDF 

27  Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy 
The Pervasive Reach of ResourceBounded Kolmogorov Complexity in Computational Complexity Theory. 
Electronic Colloquium on Computational Complexity (ECCC) 
2009 
DBLP BibTeX RDF 

27  
18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 710 July 2003, Aarhus, Denmark 
IEEE Conference on Computational Complexity 
2003 
DBLP BibTeX RDF 

27  Manindra Agrawal 
On Derandomizing Tests for Certain Polynomial Identities. 
IEEE Conference on Computational Complexity 
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][ >>] 
