Search results for "time complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Baoliang Xu, Wenjian Luo, Xingxin Pei, Min Zhang, Xufa Wang	On average time complexity of evolutionary negative selection algorithms for anomaly detection.	GEC Summit	2009	DBLP DOI BibTeX RDF	drift analysis, evolutionary negative selection algorithm, anomaly detection, artificial immune system, time complexity
3	Nils Anders Danielsson	Lightweight semiformal time complexity analysis for purely functional data structures.	POPL	2008	DBLP DOI BibTeX RDF	amortised time complexity, purely functional data structures, dependent types, lazy evaluation
3	Mikhail Ju. Moshkov	Time Complexity of Decision Trees.	T. Rough Sets	2005	DBLP DOI BibTeX RDF	decision tree, time complexity, rough set theory, test theory
3	Chuanxiong Guo	SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	time complexity, packet scheduling, high-speed networks, end-to-end delay, fair queueing
3	James H. Anderson, Yong-Jik Kim	An improved lower bound for the time complexity of mutual exclusion.	Distributed Computing	2002	DBLP DOI BibTeX RDF	Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning
2	Yingjie Cui, W. K. Wong, David W. Cheung	Privacy-Preserving Clustering with High Accuracy and Low Time Complexity.	DASFAA	2009	DBLP DOI BibTeX RDF
2	Georg Seelig, David Soloveichik	Time-Complexity of Multilayered DNA Strand Displacement Circuits.	DNA	2009	DBLP DOI BibTeX RDF
2	Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig	Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.	SSS	2009	DBLP DOI BibTeX RDF
2	Keny T. Lucas	Parallel algorithm for sorting on OTIS-ring multicomputer.	Bangalore Compute Conf.	2009	DBLP DOI BibTeX RDF	OTIS, parallel algorithm, interconnection network, sorting, time complexity
2	YongZhuang Wei, YuPu Hu	New related-key rectangle attacks on reduced AES-192 and AES-256.	Science in China Series F: Information Sciences	2009	DBLP DOI BibTeX RDF	block cipher, Advanced Encryption Standard, time complexity, related-key rectangle attack
2	Patrick Traxler	The Time Complexity of Constraint Satisfaction.	IWPEC	2008	DBLP DOI BibTeX RDF
2	Dan Dobre, Matthias Majuntke, Neeraj Suri	On the Time-Complexity of Robust and Amnesic Storage.	OPODIS	2008	DBLP DOI BibTeX RDF	distributed storage, Byzantine failures, wait-free algorithms
2	Maryam Amiripour, Hamid Abachi	Analytical Modeling of Task Scheduling for Master-Slave Super Hypercube Architecture.	SNPD	2008	DBLP DOI BibTeX RDF	modeling, time complexity, task scheduling, message passing architecture, matrix product
2	Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen	Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.	CiE	2008	DBLP DOI BibTeX RDF	linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
2	Emilie Charrier, Lilian Buzer	An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition.	DGCI	2008	DBLP DOI BibTeX RDF	Digital naive plane recognition, feasibility problem, quasi linear time complexity, chord’s algorithm, convex optimization
2	Emilie Charrier, Lilian Buzer	Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint.	IWCIA	2008	DBLP DOI BibTeX RDF	integer convex hull, Bezout identity, logarithmic time complexity, Linear constraint, continued fraction
2	Ning Zhang, Incheol Shin, Bo Li, Cem Boyaci, Ravi Tiwari, My T. Thai	New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network.	WASA	2008	DBLP DOI BibTeX RDF	Wireless Sensor Network, Approximation Algorithm, Distributed Algorithm, Time Complexity, Dominating Tree, General Graph
2	Bilel Derbel	Local Maps: New Insights into Mobile Agent Algorithms.	DISC	2008	DBLP DOI BibTeX RDF	local maps, Mobile agents, time complexity
2	James N. Knight, Monte Lunacek	Reducing the space-time complexity of the CMA-ES.	GECCO	2007	DBLP DOI BibTeX RDF	complexity, evolution strategy, covariance matrix adaptation
2	Baudoin Collard, François-Xavier Standaert, Jean-Jacques Quisquater	Improving the Time Complexity of Matsui's Linear Cryptanalysis.	ICISC	2007	DBLP DOI BibTeX RDF	Fast Fourier Transform, block ciphers, linear cryptanalysis
2	Sarang C. Joshi, S. K. Bodhe	Time Complexity Analysis for Decoding VOP Content in MPEG-4 Presentations.	ITNG	2007	DBLP DOI BibTeX RDF
2	Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao	On the analysis of average time complexity of estimation of distribution algorithms.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
2	Norman Danner, James S. Royer	Time-Complexity Semantics for Feasible Affine Recursions.	CiE	2007	DBLP DOI BibTeX RDF
2	Fabian Kuhn, Thomas Locher, Roger Wattenhofer	Tight bounds for distributed selection.	SPAA	2007	DBLP DOI BibTeX RDF	sensor networks, distributed algorithms, time complexity, data aggregation, median, in-network aggregation
2	Jianxing Feng, Daming Zhu	Faster algorithms for sorting by transpositions and sorting by block interchanges.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Block interchange, tree, time complexity, permutation, genome, transposition
2	Jiajing Zhuo, Chen Meng, Minghu Zou	A Task Scheduling Algorithm of Single Processor Parallel Test System.	SNPD	2007	DBLP DOI BibTeX RDF	Auto test system(ATS), Multi-threading technique, Task scheduling algorithm, Algorithm time complexity, Parallel test
2	Yong-Jik Kim, James H. Anderson	Adaptive mutual exclusion with local spinning.	Distributed Computing	2007	DBLP DOI BibTeX RDF	Adaptive mutual exclusion, Read/write atomicity, Time complexity, Shared-memory systems, Local spinning
2	Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki	Average-Time Complexity of Gossiping in Radio Networks.	SIROCCO	2006	DBLP DOI BibTeX RDF
2	Mingqing Hu, Andrea Boni	An Improved Reduced Set Method to Control the Run-time Complexity of SVM in Wireless Sensor Networks.	ETFA	2006	DBLP DOI BibTeX RDF
2	Zhifeng Hao, Han Huang, Xili Zhang, Kun Tu	A Time Complexity Analysis of ACO for Linear Functions.	SEAL	2006	DBLP DOI BibTeX RDF
2	Beatrice Luca, Stefan Andrei, Hugh Anderson, Siau-Cheng Khoo	Program transformation by solving recurrences.	PEPM	2006	DBLP DOI BibTeX RDF	efficient time complexity, recurrences with one or multiple parameters, program transformation
2	Katia Hristova, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller	Efficient type inference for secure information flow.	PLAS	2006	DBLP DOI BibTeX RDF	security, algorithm, information flow, time complexity, type inference
2	Rachid Guerraoui, Marko Vukolic	How fast can a very robust read be?	PODC	2006	DBLP DOI BibTeX RDF	arbitrary failures, optimal resilience, storage emulations, time-complexity
2	Wenqin Zhou, Jacques Carette, David J. Jeffrey, Michael B. Monagan	Hierarchical Representations with Signatures for Large Expression Management.	AISC	2006	DBLP DOI BibTeX RDF	Veiling Strategy, Zero Test, Large Expression Management, Symbolic LU Decomposition, Time Complexity, Signature, Hierarchical Representation
2	Rachid Guerraoui, Maurice Herlihy, Bastian Pochon	A Topological Treatment of Early-Deciding Set-Agreement.	OPODIS	2006	DBLP DOI BibTeX RDF	early global decision, lower bound, topology, time complexity, Set-agreement
2	Yong-Jik Kim, James H. Anderson	Nonatomic mutual exclusion with local spinning.	Distributed Computing	2006	DBLP DOI BibTeX RDF	Nonatomic operations, Lower bounds, Shared memory, Time complexity, Mutual exclusion
2	Xin Yao, Yong Xu	Recent Advances in Evolutionary Computation.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	computational time complexity, evolutionary computation, real-world application, neural network ensemble, prisoner's dilemma
2	Zhi-hong Zuo, Qing-xin Zhu, Ming-tian Zhou	On the time complexity of computer viruses.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
2	Gildas Avoine, Etienne Dysli, Philippe Oechslin	Reducing Time Complexity in RFID Systems.	Selected Areas in Cryptography	2005	DBLP DOI BibTeX RDF
2	Partha Dutta, Rachid Guerraoui	The inherent price of indulgence.	Distributed Computing	2005	DBLP DOI BibTeX RDF	Keywors Fault tolerance, Consensus time complexity, Distributed algorithms
2	Gongyun Zhao	A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming.	Math. Program.	2005	DBLP DOI BibTeX RDF	multi-stage stochastic nonlinear programming, lagrangian dual, self-concordant barrier, interior point methods, polynomial-time complexity
2	Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi	The Worst-Case Time Complexity for Generating All Maximal Cliques.	COCOON	2004	DBLP DOI BibTeX RDF
2	Henk Bekker, Axel Brink	Reducing the Time Complexity of Minkowski-Sum Based Similarity Calculations by Using Geometric Inequalities.	ICCSA	2004	DBLP DOI BibTeX RDF
2	Bernadette Charron-Bost, Fabrice Le Fessant	Validity Conditions in Agreement Problems and Time Complexity.	SOFSEM	2004	DBLP DOI BibTeX RDF	Complexity, Distributed Algorithms
2	Partha Dutta, Rachid Guerraoui, Ron R. Levy, Arindam Chakraborty	How fast can a distributed atomic read be?	PODC	2004	DBLP DOI BibTeX RDF	time-complexity, atomic registers, shared-memory emulation
2	Wenling Wu, Dengguo Feng, Hua Chen	Collision Attack and Pseudorandomness of Reduced-Round Camellia.	Selected Areas in Cryptography	2004	DBLP DOI BibTeX RDF	Block cipher, Time complexity, Pseudorandomness, Data complexity, Camellia
2	Marc R. C. van Dongen	Saving Support-Checks Does Not Always Save Time.	Artif. Intell. Rev.	2004	DBLP DOI BibTeX RDF	maintain arc-consistency, Abbrevations:, CSP - constraint satisfaction problem, MAC - maintain arc consistency, RLFAP - radio link frequency assignment problem, search, heuristics, constraint satisfaction, time-complexity, space-complexity
2	Seon Ok Lee, Seok Won Jung, Chang Han Kim, Janghong Yoon, Jae-Young Koh, Daeho Kim	Design of Bit Parallel Multiplier with Lower Time Complexity.	ICISC	2003	DBLP DOI BibTeX RDF
2	Hyunjung Shin, Sungzoon Cho	Fast Pattern Selection Algorithm for Support Vector Classifiers: Time Complexity Analysis.	IDEAL	2003	DBLP DOI BibTeX RDF
2	Avraham Trakhtman	Reducing the Time Complexity of Testing for Local Threshold Testability.	CIAA	2003	DBLP DOI BibTeX RDF	threshold locally testable, algorithm, graph, Automaton
2	Franck Guingne, André Kempe, Florent Nicart	Running Time Complexity of Printing an Acyclic Automaton.	CIAA	2003	DBLP DOI BibTeX RDF
2	Yoshihiro Nakaminami, Toshimitsu Masuzawa, Ted Herman	A Method for Evaluating Efficiency of Protocols on the Asynchronous Shared-State Model.	Self-Stabilizing Systems	2003	DBLP DOI BibTeX RDF	asynchronous model, synchronous execution, linear state-transition protocol, Distributed system, distributed algorithm, time complexity
2	Jie Li, Yi Pan, Hong Shen	More Efficient Topological Sort Using Reconfigurable Optical Buses.	The Journal of Supercomputing	2003	DBLP DOI BibTeX RDF	time complexity, analysis of algorithms, massive parallelism, graph problem, optical bus
2	Pawan Lingras, Y. Y. Yao	Time Complexity of Rough Clustering: GAs versus K-Means.	Rough Sets and Current Trends in Computing	2002	DBLP DOI BibTeX RDF
2	Nicola Ancona, Grazia Cicirelli, Ettore Stella, Arcangelo Distante	Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines.	ICPR	2002	DBLP DOI BibTeX RDF
2	Guo Chuanxiong	SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks.	SIGCOMM	2001	DBLP DOI BibTeX RDF	QoS, Internet, complexity, packet scheduler, high speed networks, end-to-end delay, fair queueing
2	Yong-Jik Kim, James H. Anderson	A Time Complexity Bound for Adaptive Mutual Exclusion.	DISC	2001	DBLP DOI BibTeX RDF
2	Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir	Axiomatizing Tropical Semirings.	FoSSaCS	2001	DBLP DOI BibTeX RDF	relative axiomatizations, commutative idempotent weak semirings, tropical semirings, exponential time complexity, convexity, varieties, Equational logic, complete axiomatizations
2	Han Kesong, Yongcheng Wang, Guilin Chen	Research on a faster algorithm for pattern matching.	IRAL	2000	DBLP DOI BibTeX RDF	Boyer-Moore algorithm, quick search algorithm, pattern matching, time complexity
2	A. S. Nepomniaschaya	An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. (PDF / PS)	ICPADS	2000	DBLP DOI BibTeX RDF	Directed weighted graph, critical cycle, optimum branching, bit-serial processing, associative parallel processor, time complexity
2	Heejong Suh, Carl K. Chang	Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. (PDF / PS)	LCN	2000	DBLP DOI BibTeX RDF	minimal cutsets enumeration, branch addition, graph method, graph tree, sub-vertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search
2	James H. Anderson, Philip Holman	Efficient pure-buffer algorithms for real-time systems.	RTCSA	2000	DBLP DOI BibTeX RDF	efficient pure-buffer algorithms, multiprocessor real-time systems, multi-writer read/write pure-buffers, overwritten data, client processes, handshaking mechanisms, concurrent read/write operations safety, quantum-scheduled systems, priority-scheduled systems, buffer word length, real-time systems, computational complexity, distributed algorithms, safety, multiprocessing systems, time complexity, processor scheduling, optimized algorithms, buffer storage, space complexity, wait-free algorithms, shared buffers, processor number
2	Hyungill Kim, Sungyoung Lee, Byeong-Soo Jeong	An improved feasible shortest path real-time fault-tolerant scheduling algorithm.	RTCSA	2000	DBLP DOI BibTeX RDF	feasible shortest path real time fault tolerant scheduling algorithm, real time single processor environment, queue based scheduling techniques, feasible shortest path algorithm, linear time heuristics, FSP algorithm, optimal fault tolerant schedules, LTH algorithm, real time scheduling performance, backup scheduling, minimum inter-fault time, primary tasks, fault tolerant schedule, backup schedules, scheduling, fault tolerance, real-time systems, computational complexity, fault tolerant computing, queueing theory, time complexity, timing constraints, system performance, greedy heuristics, time interval, real time computer systems
2	Ricardo A. Baeza-Yates, Gabriel Valiente	An Image Similarity Measure Based on Graph Matching. (PDF / PS)	SPIRE	2000	DBLP DOI BibTeX RDF	image similarity measure, extended region adjacency graphs, invariance to translation, invariance to rotation, invariance to scaling, pixel similarity threshold, distance measure approximation, image recognition, directed graph, time complexity, image matching, error, graph matching, pixels
2	Andreas Jakoby	The Average Time Complexity to Compute Prefix Functions in Processor Networks.	STACS	1999	DBLP DOI BibTeX RDF
2	Jyh-Huei Guo, Chin-Liang Wang	A low time-complexity, hardware-efficient bit-parallel power-sum circuit for finite fields GF(2M).	ISCAS	1999	DBLP DOI BibTeX RDF
2	Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein	Pattern Matching with Swaps.	FOCS	1997	DBLP DOI BibTeX RDF	swapped matching, O(mn) time, pattern matching, pattern matching, time complexity, text string
2	Muhammad Kafil, Ishfaq Ahmad	Optimal task assignment in heterogeneous computing systems.	Heterogeneous Computing Workshop	1997	DBLP DOI BibTeX RDF	optimal task assignment, best-first search technique, assignment algorithm, distributed systems, computational complexity, artificial intelligence, high-performance computing, NP-hard, time complexity, clustering technique, search technique, heuristic techniques, heterogeneous computing systems
2	David J. Lieberman, Jan P. Allebach	Efficient Model Based Halftoning Using Direct Binary Search. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	model based halftoning, direct binary search algorithm, grayscale original image, halftone quality, HVS model parameters, halftone updating, image processing, efficiency, iterative method, time complexity, human visual system, pixel, local minimum, halftone image
2	Matthias Ruhl, Hannes Hartenstein, Dietmar Saupe	Adaptive Partitionings for Fractal Image Compression. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	adaptive partitionings, fractal image compression, split-and-merge process, connected sets, small square image blocks, rate-distortion curves, encoding quality, evolutionary computing, data compression, time-complexity, ranges, acceleration techniques
2	Yu-Kwong Kwok, Ishfaq Ahmad	A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling
2	Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano	Multiple Templates Access of Trees in Parallel Memory Systems. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
2	Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis	DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	DFRN, duplication based scheduling, distributed memory multiprocessor systems, parallel execution time minimization, DBS algorithms, task duplication method, worst case behavior, tree structured input directed acyclic graph, time complexity, distributed memory systems, performance improvement, optimal schedule, boundary condition, multiprocessor scheduling problems
2	Pi-Rong Sheu, Charng-Maw Lin	A fast optimal slot reuse scheme for CRMA high speed networks. (PDF / PS)	LCN	1997	DBLP DOI BibTeX RDF	CRMA high speed networks, cyclic-reservation multiple-access, fast optimal slot reuse scheme, high-speed local area networks, high-speed metropolitan area networks, folded-bus configurations, dual-bus configurations, reserve command generation, empty slots reservation, average cycle length, average throughput, average MAC delay, performance measurements, time complexity, computer simulations, NP-complete problem, metropolitan area networks, access delay
2	Keqin Li	Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System.	The Journal of Supercomputing	1997	DBLP DOI BibTeX RDF	Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication
2	Chunming Qiao, Luying Zhou	Establishing switch-disjoint connections in stage-controlled Banyans.	ISPAN	1996	DBLP DOI BibTeX RDF	switch-disjoint connections, stage-controlled Banyans, parallel algorithms, parallel algorithms, computational complexity, multiprocessor interconnection networks, Banyan networks, polynomial time complexity, photonic switching
2	Hong Shen	Fault-tolerant multicast with traffic-balancing in hypercubes.	ISPAN	1996	DBLP DOI BibTeX RDF	traffic-balancing, fault-tolerant multicast, fault-tolerant multicasting, computational complexity, parallel architectures, fault tolerant computing, hypercubes, time complexity, hypercube networks, interprocessor communication, hypercube computers
2	Edmund M. Clarke, Masahiro Fujita, Xudong Zhao	Hybrid decision diagrams.	ICCAD	1995	DBLP DOI BibTeX RDF	MTBDDs, arithmetic circuits verification, boolean vectors, hybrid decision diagrams, linear expressions, multi-terminal binary decision diagrams, symbolic model checking algorithms, computational complexity, time complexity, digital arithmetic, binary decision diagrams, circuit analysis computing, integers, BMDs
2	Miodrag Potkonjak, Sujit Dey, Kazutoshi Wakabayashi	Design-for-debugging of application specific designs.	ICCAD	1995	DBLP DOI BibTeX RDF	debugging requirements, scheduling, computational complexity, combinatorial optimization, controllability, high level synthesis, design for testability, observability, application specific integrated circuits, circuit CAD, hardware support, polynomial time complexity, Design-for-Debugging, synthesis algorithm
2	Oriol Roig, Jordi Cortadella, Enric Pastor	Hierarchical gate-level verification of speed-independent circuits.	ASYNC	1995	DBLP DOI BibTeX RDF	hierarchical gate-level verification, state signals, computational complexity, logic testing, time complexity, asynchronous circuits, speed-independent circuits, complex gates
2	Mohamed Naimi	Parallel assignment to distinct identities in arbitrary networks.	ICCCN	1995	DBLP DOI BibTeX RDF	sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems
2	Jin-Tai Yan	An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering. (PDF / PS)	ICCD	1995	DBLP DOI BibTeX RDF	cut-based algorithm, L-shaped channels, safe routing ordering, geometrical topology, floorplan graph, channel precedence graph, S-cuts, redundant L-cuts, balanced L-cuts, non-minimal L-cuts, non-critical L-cuts, critical L-cuts, computational complexity, time complexity, circuit layout CAD, line segments, precedence relations
2	Yuntao Cui, Daniel L. Swets, Juyang Weng	Learning-Based Hand Sign Recognition Using SHOSLIF-M. (PDF / PS)	ICCV	1995	DBLP DOI BibTeX RDF	SHOSLIF-M, self-organizing framework, learning-based hand sign recognition, spatiotemporal event recognition, spatiotemporal event learning, intensity image sequences, multiclass multivariate discriminant analysis, most discriminating features, space partition tree, logarithmic retrieval time complexity, interpolation scheme, view inference, computer vision, computational complexity, database, object recognition, interpolation, generalization, image sequences, patterns, image recognition, inference mechanisms, learning systems, generalisation (artificial intelligence), recognition rate, multivariable systems, self-adjusting systems
2	Y. J. Bae, Michael C. Fairhurst	Parallelism in dynamic time warping for automatic signature verification. (PDF / PS)	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
2	Dinesh Nair, Amar Mitiche, Jake K. Aggarwal	On comparing the performance of object recognition systems. (PDF / PS)	ICIP	1995	DBLP DOI BibTeX RDF	statistical indicators, algorithmic indicators, Kruskal-Wallis H test, space complexity measures, time complexity measures, performance curves, test data sample size, computational complexity, object recognition, statistical analysis, pattern classification, error, performance comparison, pattern classifiers, object recognition systems
2	Garng M. Huang, Shan Zhu	A fast distributed optimal routing algorithm for multicommodity large data networks. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	fast distributed optimal routing algorithm, multicommodity large data networks, large data network, multicommodities, parallel time complexity, flow demand, OPNET simulation tool, computational complexity, distributed algorithms
2	Behrooz Parhami, Ching Yu Hung	Robust shearsort on incomplete bypass meshes. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	robust shearsort, incomplete bypass meshes, incomplete 2-D bypass mesh, sorting scheme, shearsort, asymptotic time complexity, fault tolerance, parallel algorithms, computational complexity, fault tolerant computing, sorting, processing elements, reconfiguration schemes
2	Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng	Recognizing depth-first-search trees in parallel. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model
2	Chao-Ju Hou, Ching-Chih Han, Wun-Chun Chau	Priority-based high-speed switch scheduling for ATM networks. (PDF / PS)	LCN	1995	DBLP DOI BibTeX RDF	iterated switching networks, priority-based high-speed switch scheduling, AN2 switch, parallel iterative matching algorithm, maximal input-output matching, priority lists, input/output pairs, probability analysis, switch size, high QoS requirements, simulation, scheduling, parallel algorithms, computational complexity, asynchronous transfer mode, probability, local area networks, iterative methods, time complexity, ATM networks, iterations, switches, high-performance distributed computing
2	Matthias Besch, Hans Werner Pohl	Flexible data parallel training of neural networks using MIMD-Computers.	PDP	1995	DBLP DOI BibTeX RDF	data parallel training, MIMD-Computers, training data sets, distributed logarithmic tree, neural networks, parallel programming, time complexity, backpropagation, feedforward neural nets, training algorithms
2	Yoshifumi Manabe, Shigemi Aoyagi	A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks. (PDF / PS)	IEEE Real Time Technology and Applications Symposium	1995	DBLP DOI BibTeX RDF	feasibility decision algorithm, periodic real-time tasks, task scheduling algorithm, periodic real time task systems, real time task system, inverse deadline scheduling algorithm, scheduling, real-time systems, computational complexity, time complexity, scheduling algorithm, rate monotonic scheduling
2	Tony Savor, Rudolph E. Seviora	Improving the efficiency of supervision by software through state aggregation. (PDF / PS)	IEEE Real Time Technology and Applications Symposium	1995	DBLP DOI BibTeX RDF	private telephone exchanges, supervisory software, software supervision, real time failure detection, real time system monitoring, running time complexity, specification processes, software supervisor, ITU Specification and Description Language, small private branch telephone exchange, SDL processes, telecom switching software, real-time systems, computational complexity, formal specification, fault diagnosis, telecommunication computing, state transitions, telecommunication control, computerised monitoring, inputs queues, state aggregation
2	Amos Israeli, Asaf Shirazi	The Time Complexity of Updating Snapshot Memories.	ESA	1994	DBLP DOI BibTeX RDF
2	Ashish V. Naik, Kenneth W. Regan, D. Sivakumar	Quasilinear Time Complexity Theory.	STACS	1994	DBLP DOI BibTeX RDF
2	Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta	Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	context-sensitive grammars, optimal probabilistic evaluation functions, word sequences, probability computation, partial word sequences, best parse tree, cubic time complexity, computational complexity, search, natural language processing, probability, probabilities, language modeling, natural languages, stochastic context-free grammars
2	Eiichi Tanaka	A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees
2	Mayez A. Al-Mouhamed, Adel Al-Maasarani	Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	scheduling precedence-constrained computations, multiprocessor topology, global priority-based schedulingheuristics, generalized list scheduling, backward scheduling, graph-driven scheduling, scheduling, performance evaluation, performance evaluation, computational complexity, multiprocessor, message passing, network topology, time complexity, message-passing systems
2	Judith O. Berkey, Pearl Y. Wang	A Systolic-Based Parallel Bin Packing Algorithm.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	systolic-based parallel bin packing algorithm, asymptotic error bound, execution performance, serial algorithms, parallel algorithms, computational complexity, approximation algorithm, parallelizations, time complexity, systolic arrays, operations research
2	Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan	Parallel Dynamic Programming.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	parallel dynamicprogramming, optimal binary search tree, optimal triangulation ofpolygons, CREW PRAM algorithm, parallel algorithms, computational complexity, dynamic programming, time complexity, matrix multiplication
2	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, protocols, distributed algorithms, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation