Search results for "deletion"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
25	Sylvia D. Monson	The effects of vertex deletion and edge deletion on the clique partition number.	Ars Comb.	1996	DBLP BibTeX RDF
25	Mathias Schlauweg, Dima Pröfrock, Benedikt Zeibich, Erika Müller	Self-synchronizing robust texel watermarking in gaussian scale-space.	MM&Sec	2008	DBLP DOI BibTeX RDF	gaussian scale-space, insertion/deletion error correction, rst-invariant, texture-based feature points, digital watermarking
25	Marco Riani, Anthony C. Atkinson	Fast calibrations of the forward search for testing multiple outliers in regression.	Adv. Data Anal. Classif.	2007	DBLP DOI BibTeX RDF	Beta-distributed errors, Deletion residual, Multiple outliers, Truncated t distribution, Order statistics, Robust methods
25	Ramakanth Kavuluru, Andrew Klapper	On the k -Operation Linear Complexity of Periodic Sequences.	INDOCRYPT	2007	DBLP DOI BibTeX RDF	k symbol insertion, k symbol deletion, linear complexity, Periodic sequence, k-error linear complexity
25	Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White	Reverse-Complement Similarity Codes.	GTIT-C	2006	DBLP DOI BibTeX RDF	code distance, rate of codes, insertion-deletion codes, similarity, codes, sequences, DNA sequences, subsequences
25	Anarta Ghosh, Nicolai Petkov	Robustness of Shape Descriptors to Incomplete Contour Representations.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF	COIL, depletion, distance multiset, Gollin, ICR test, object recognition, shape, occlusion, MPEG-7, psychophysics, Contour, deletion, incompleteness, shape context
25	Zuhoor A. Al-Khanjari, Martin R. Woodward, Haider Ali Ramadhan, Narayana Swamy Kutti	The Efficiency of Critical Slicing in Fault Localization.	Softw. Qual. J.	2005	DBLP DOI BibTeX RDF	strong and weak mutations, dead, live and equivalent mutants, static and dynamic slicing, critical slicing, statement deletion (Sdl), Mothra Mutation Testing System, Fortran-77, mutation testing, mutation operator
25	Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk	Finding maximum independent sets in graphs arising from coding theory.	SAC	2002	DBLP DOI BibTeX RDF	codes for Z-channel, deletion-correcting codes, transposition-correction codes, maximum independent set
25	Ingunn Myrtveit, Erik Stensrud, Ulf H. Olsson	Analyzing Data Sets with Missing Data: An Empirical Evaluation of Imputation Methods and Likelihood-Based Methods.	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	imputation methods, listwise deletion, mean imputation, similar response pattern imputation, full information maximum likelihood, log-log regression, ERP, cost estimation, missing data, Software effort prediction
25	Rick van Rein	Specifying Processes with Dynamic Life Cycles.	CAiSE	2000	DBLP DOI BibTeX RDF	polymorphic creation and deletion, communication, object orientation, conceptual modelling, process algebra, life cycles, component composition, state diagrams
25	Taehyung Wang, Phillip C.-Y. Sheu	An Object-Oriented Approach to Visual Database.	ICTAI	1997	DBLP DOI BibTeX RDF	lens angle, object-oriented rendering approach, R+ tree, hierarchical storage, region tree, virtual reality, real-time system, object-oriented databases, moving objects, camera, visual databases, insertion, deletion, spatial indexing, object retrieval, characteristic view
25	C. A. Fleischer, Lee A. Belfore II	A new approach for testing artificial neural networks.	VTS	1997	DBLP DOI BibTeX RDF	interconnection deletion faults, faulted ANN, activation function gains, testing, artificial neural networks, neural chips, transient behavior
25	Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis	Quickest paths: parallelization and dynamization .	HICSS (2)	1995	DBLP DOI BibTeX RDF	dynamic quickest path problem, transmission time, minimum transmission time, fast data transmissions, edge lead times, edge capacities, data structure updating, edge deletion, single pair quickest path problem, parallel algorithms, parallel algorithms, computational complexity, parallelization, data structures, dynamization, directed graphs, directed graph, travelling salesman problems, communication networks, operations research, telecommunication networks, sparse network, dynamic change
25	Alessandro Ciampichetti, Elisa Bertino, Luigi V. Mancini	Mark-and-Sweep Garbage Collection in Multilevel Secure Object-Oriented Database Systems.	ESORICS	1994	DBLP DOI BibTeX RDF	object deletion, mark-and-sweep, garbage collection, mandatory access control, object-oriented database systems
25	Elie Georges Hayeck	User-computer interaction employing block mode data transfer.	ACM Southeast Regional Conference	1982	DBLP DOI BibTeX RDF	Video display terminal, block mode, data deletion, data display, form, data update, patient record, modular approach, data entry
25	Werner E. Kluge	Data File Management in Shift Register Memories.	ACM Trans. Database Syst.	1978	DBLP DOI BibTeX RDF	LIFO/FIFO operation modes, management of sequentially organized files, record retrieval, updating, insertion, data transformations, deletion, relocation, shift-register memories
23	Bernhard Haeupler, Siddhartha Sen 0001, Robert Endre Tarjan	Rank-Balanced Trees.	WADS	2009	DBLP DOI BibTeX RDF
23	Stefan Kratsch, Magnus Wahlström	Two Edge Modification Problems without Polynomial Kernels.	IWPEC	2009	DBLP DOI BibTeX RDF
23	Ilya Averbouch, Benny Godlin, Johann A. Makowsky	A Most General Edge Elimination Polynomial.	WG	2008	DBLP DOI BibTeX RDF
23	Luke Mathieson, Stefan Szeider	Parameterized Graph Editing with Chosen Vertex Degrees.	COCOA	2008	DBLP DOI BibTeX RDF
23	Guomeng Wang, Yanping Zhao	A fast algorithm for data erasure.	ISI	2008	DBLP DOI BibTeX RDF
23	Lara Dolecek, Venkat Anantharam	Using Reed-Muller RM(1, m) Codes Over Channels With Synchronization and Substitution Errors.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
23	Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi	DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation.	ICDE	2007	DBLP DOI BibTeX RDF
23	Jürgen Dassow, Bianca Truthe	On the Power of Networks of Evolutionary Processors.	MCU	2007	DBLP DOI BibTeX RDF
23	Marcus Hutter, Shane Legg	Fitness uniform optimization.	IEEE Trans. Evol. Comput.	2006	DBLP DOI BibTeX RDF
23	Kazuhiro Morita, El-Sayed Atlam, Masao Fuketa, Elmarhomy Ghada, Masaki Oono, Toru Sumitomo, Jun-ichi Aoe	New Approach for Speeding-up Technique of the Retrieval Using Dynamic Full-Text Search Algorithm.	KES (4)	2005	DBLP DOI BibTeX RDF
23	K. K. Lee, D. F. Wong 0001	Incremental reconfiguration of multi-FPGA systems.	FPGA	2002	DBLP DOI BibTeX RDF
23	Ron Shamir, Roded Sharan, Dekel Tsur	Cluster Graph Modification Problems.	WG	2002	DBLP DOI BibTeX RDF
23	Rajeev Murgai	Delay-Constrained Area Recovery Via Layout-Driven Buffer Optimization.	VLSI Design	2000	DBLP DOI BibTeX RDF
23	Hai Tao, Harpreet S. Sawhney, Rakesh Kumar 0001	A Sampling Algorithm for Tracking Multiple Objects.	Workshop on Vision Algorithms	1999	DBLP DOI BibTeX RDF
23	Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney	Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF
23	Michael Rizzo	Using Producer and Consumer Manipulators to Extend Stream I/O Formatting in C++.	ACM SIGPLAN Notices	1994	DBLP DOI BibTeX RDF	C++
23	Geoff Sutcliffe	The Semantically Guided Linear Deduction System.	CADE	1992	DBLP DOI BibTeX RDF
20	Hai-yan Shan, Wenping Wang	Modeling of Evolving Knowledge Network with Node Deletion.	WKDD	2009	DBLP DOI BibTeX RDF
20	Jianmin Wang 0003	Some combinatorial constructions for optimal perfect deletion-correcting codes.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	05B30, AMS Classifications 94B65
20	David J. Coumou, Gaurav Sharma 0001	Insertion, Deletion Codes With Feature-Based Embedding: A New Paradigm for Watermark Synchronization With Applications to Speech Watermarking.	IEEE Trans. Inf. Forensics Secur.	2008	DBLP DOI BibTeX RDF
20	Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	König Deletion Sets and Vertex Covers above the Matching Size.	ISAAC	2008	DBLP DOI BibTeX RDF
20	Krishnamurthy Viswanathan, Ram Swaminathan	Improved string reconstruction over insertion-deletion channels.	SODA	2008	DBLP BibTeX RDF
20	Renato Bueno, Agma J. M. Traina, Caetano Traina Jr.	An algorithm for effective deletion and a new optimization technique for metric access methods.	SAC	2008	DBLP DOI BibTeX RDF	delete operation, index optimization, metric datasets, similarity queries, metric access methods
20	Hangpei Tian, Deyuan Gao, Wu Wei, Xiaoya Fan, Yian Zhu	Improving Performance of Partial Reconfiguration Using Strategy of Virtual Deletion.	FCCM	2008	DBLP DOI BibTeX RDF
20	Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier	Fixed-Parameter Algorithms for Cluster Vertex Deletion.	LATIN	2008	DBLP DOI BibTeX RDF
20	Weiwei Wu 0001, Minming Li, Enhong Chen	Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost.	COCOON	2008	DBLP DOI BibTeX RDF
20	John S. Preisser, Jamie Perin	Deletion diagnostics for marginal mean and correlation model parameters in estimating equations.	Stat. Comput.	2007	DBLP DOI BibTeX RDF	Cluster trial, Generalized estimating equations, Intracluster correlation, Influence, Logit models
20	Eleni Drinea, Michael Mitzenmacher	Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
20	Dániel Marx, Ildikó Schlotter	Obtaining a Planar Graph by Vertex Deletion.	WG	2007	DBLP DOI BibTeX RDF
20	Jianmin Wang, Jianxing Yin	Constructions for Perfect 5-Deletion-Correcting Codes of Length 7.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
20	Ling Wang 0003, Liefeng Bo, Licheng Jiao	Sparse Kernel Ridge Regression Using Backward Deletion.	PRICAI	2006	DBLP DOI BibTeX RDF
20	Hernan P. Awad, Peter W. Glynn	On an initial transient deletion rule with rigorous theoretical support.	WSC	2006	DBLP DOI BibTeX RDF
20	Theodor Richardson, Song Wang 0002	Nonrigid Shape Correspondence Using Landmark Sliding, Insertion and Deletion.	MICCAI (2)	2005	DBLP DOI BibTeX RDF
20	Nikolai Joukov, Erez Zadok	Adding Secure Deletion to Your Favorite File System.	IEEE Security in Storage Workshop	2005	DBLP DOI BibTeX RDF	Unintended data recovery, Security
20	David B. Lomet	Simple, Robust and Highly Concurrent B-trees with Node Deletion.	ICDE	2004	DBLP DOI BibTeX RDF
20	Arkadii G. D'yachkov, Anthony J. Macula, Wendy K. Pogozelski, Thomas E. Renz, Vyacheslav V. Rykov, David C. Torney	A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes.	DNA	2004	DBLP DOI BibTeX RDF
20	Michael Domaratzki	Semantic Shuffle on and Deletion Along Trajectories.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
20	Nguyen Xuan Hoai, Robert I. McKay	Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators.	GECCO (2)	2004	DBLP DOI BibTeX RDF
20	Eiji Uchino, Noriaki Suetake, Chuhei Ishigaki	Topographic Map Formation Employing kMER with Units Deletion Rule.	KES	2004	DBLP DOI BibTeX RDF
20	Rosie Jones, Daniel C. Fain	Query word deletion prediction.	SIGIR	2003	DBLP DOI BibTeX RDF	web search, query reformulation, query modeling
20	Flavio Tonidandel, Marcio Rillo	Releasing Memory Space through a Case-Deletion Policy with a Lower Bound for Residual Competence.	ICCBR	2001	DBLP DOI BibTeX RDF
20	Shankara Narayanan Krishna, Raghavan Rama 0001	Insertion-Deletion P Systems.	DNA	2001	DBLP DOI BibTeX RDF
20	Michiharu Maeda, Hiromi Miyajima	Properties of deletion methods in competitive learning.	ISCAS (3)	2001	DBLP DOI BibTeX RDF
20	Longin Jan Latecki, Rolf Lakämper	Polygon Evolution by Vertex Deletion.	Scale-Space	1999	DBLP DOI BibTeX RDF
20	T. Yung Kong	Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images.	DGCI	1997	DBLP DOI BibTeX RDF
20	Friedhelm Hinz	Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats.	STACS	1989	DBLP DOI BibTeX RDF
17	Da Xiao, Wenbin Yao, Chunhua Wu, Cong Wang 0003, Yixian Yang	VAOFS: A Verifiable Append-Only File System for Regulatory Compliance.	GCC	2009	DBLP DOI BibTeX RDF	append-only file system, secure deletion, regulatory compliance
17	Manish S. Gupta, Amit Pathak, Soumen Chakrabarti	Fast algorithms for topk personalized pagerank queries.	WWW	2008	DBLP DOI BibTeX RDF	hubrank, node-deletion, personalized, pagerank, top-k
17	Jesús T. Pastor, C. A. Knox Lovell, Henry Tulkens	Evaluating the financial performance of bank branches.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Variable deletion tests, Banking, Performance indicators
17	Jacob O. Wobbrock, Brad A. Myers	Analyzing the input stream for character- level errors in unconstrained text entry evaluations.	ACM Trans. Comput. Hum. Interact.	2006	DBLP DOI BibTeX RDF	input stream, minimum string distance, nonrecognition, optimal alignment, presented string, recognizer, stream alignment, transcribed string, gesture, character recognition, Text entry, text input, stroke, error rate, insertion, deletion, substitution, confusion matrix, EdgeWrite, omission
17	Giovanni Di Crescenzo	Security of erasable memories against adaptive adversaries.	StorageSS	2005	DBLP DOI BibTeX RDF	erasable memory, secure data deletion, storage security
17	Joseph Y. Halpern, Vanessa Teague	Rational secret sharing and multiparty computation: extended abstract.	STOC	2004	DBLP DOI BibTeX RDF	iterated deletion of weakly dominated strategies, non-cooperative computing, game theory, secret sharing, multiparty computation
17	Mustafa M. Tikir, Jeffrey K. Hollingsworth	Efficient instrumentation for code coverage testing.	ISSTA	2002	DBLP DOI BibTeX RDF	dynamic code deletion, dynamic code patching, on-demand instrumentation, testing, code coverage, dominator tree
17	Brigitte Vallée	Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes.	Algorithmica	2001	DBLP DOI BibTeX RDF	Node deletion, Node replacement, Minimum spanning tree, CREW PRAM
17	Monika Rauch Henzinger, Valerie King	Fully Dynamic Biconnectivity and Transitive Closure.	FOCS	1995	DBLP DOI BibTeX RDF	fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory
17	Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni	Deleting Vertices to Bound Path Length.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	vertex deletion problem, path length bound, weighted directed acyclic graphs, quadratic time, computational complexity, directed graphs, NP-hard problems, linear time, series-parallel graph, rooted tree
17	Mi Lu, Hua Lin	Parallel Algorithms for the Longest Common Subsequence Problem.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound
17	Akhil Kumar 0001	G-Tree: A New Data Structure for Organizing Multidimensional Data.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	G-tree, multidimensional data organisation, grid tree, ordering property, multidimensional space, partition numbers, dynamic data spaces, nonuniform data distributions, deletion operations, BD tree, zkdb tree, KDB tree, simulated bucket utilization rates, data structure, trees (mathematics), range queries, B-trees, tree data structures, data handling
17	Yasuaki Nakamura, Shigeru Abe, Yutaka Ohsawa, Masao Sakauchi	A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	balanced hierarchical data structure, highly efficient dynamic characteristics, multidimensional tree, worst-case storage utilization, dynamic characteristics, simulation, B-tree, tree data structures, insertion, deletion, multidimensional data, spatial searching, retrieval performance
17	Amihood Amir, Martin Farach	Adaptive Dictionary Matching	FOCS	1991	DBLP DOI BibTeX RDF	pattern insertion, pattern deletion, text scanning, adaptive dictionary matching algorithms, dictionary pattern, dictionary construction, logarithmic overhead, parallel algorithms, data structure, suffix trees, sequential algorithm
17	Siu-Wing Cheng, Ravi Janardan	New Results on Dynamic Planar Point Location	FOCS	1990	DBLP DOI BibTeX RDF	persistent scheme, chain insertion, chain deletion, dynamic planar point location, n-vertex dynamic planar subdivision, query time, update time, k-edge monotone chain, algebraic segments, computational complexity, time bounds, connected graph
17	Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao	Approximation through Multicommodity Flow	FOCS	1990	DBLP DOI BibTeX RDF	minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
17	Meng Chang Chen, Lawrence McNamee	On the Data Model and Access Method of Summary Data Management.	IEEE Trans. Knowl. Data Eng.	1989	DBLP DOI BibTeX RDF	summary data management, trinary tuple, statistical function, metaknowledge, average-income, female engineer, derivability problem, disjointness constraint, SD tree, summary data search, computational complexity, data structures, experience, database management systems, data model, access method, insertion, category, deletion, summary, multidimensional access method
17	Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan	Dynamic Perfect Hashing: Upper and Lower Bounds	FOCS	1988	DBLP DOI BibTeX RDF	dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem
17	Franco P. Preparata, Roberto Tamassia	Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	insertion/deletion, fully dynamic techniques, planar structures, planar st-graph, transitive-closure queries, monotone subdivisions, chain method, Lee-Preparata, data structure, update, edges, transitive closure, faces, set, vertices, total orders, point location
17	Gian Carlo Bongiovanni, C. K. Wong	Tree Search in Major/Minor Loop Magnetic Bubble Memories.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	major loops, minor loops, number of comparisons, one-sided height-balanced trees, one-sided K-height-balanced trees, record movement, Analysis of algorithms, insertion, deletion, tree search, balanced trees, magnetic bubble memories
17	Kin-Man Chung, Fabrizio Luccio, C. K. Wong	A Tree Storage Scheme for Magnetic Bubble Memories.	IEEE Trans. Computers	1980	DBLP DOI BibTeX RDF	searching, Analysis of algorithms, insertion, deletion, tree searching, magnetic bubble memories
15	Shiqing Xin, GuoJin Wang	New method in information processing for maintaining an efficient dynamic ordered set.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	dynamic ordered set, rich binary tree, information processing, algorithms and data structures
15	Xinjie Lv, Tian Yang, Zaifei Liao, Manzoor Elahi, Wei Liu 0023, Hongan Wang	Incremental outlier detection in data streams using local correlation integral.	SAC	2009	DBLP DOI BibTeX RDF	local correlation integral, multi-granularity deviation factor, data streams, outlier detection
15	Arash Farzan, J. Ian Munro	Dynamic Succinct Ordered Trees.	ICALP (1)	2009	DBLP DOI BibTeX RDF
15	Ilya Averbouch, Johann A. Makowsky, Peter Tittmann 0001	A Graph Polynomial Arising from Community Structure (Extended Abstract).	WG	2009	DBLP DOI BibTeX RDF
15	Noritaka Shigei, Hiromi Miyajima, Shinya Nagamine	A Proposal of Fuzzy Inference Model Composed of Small-Number-of-Input Rule Modules.	ISNN (2)	2009	DBLP DOI BibTeX RDF	Fuzzy reasoning model, Single-input rule module, Small-number-of-input rule module, A large number of input variables
15	Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer	Maintaining Arrays of Contiguous Objects.	FCT	2009	DBLP DOI BibTeX RDF
15	Stefan Gremalschi, Gulsah Altun, Irina Astrovskaya, Alexander Zelikovsky	Mean Square Residue Biclustering with Missing Data and Row Inversions.	ISBRA	2009	DBLP DOI BibTeX RDF	Mean Square Residue, Biclustering
15	Carmen Escribano, Antonio Giraldo, María Asunción Sastre	Thinning Algorithms as Multivalued N{\mathcal{N}}-Retractions.	DGCI	2009	DBLP DOI BibTeX RDF	continuous multivalued function, Digital images, digital topology, simple point, retraction, thinning algorithm
15	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
15	Xiaolong Jin, Jianmin Jiang, Geyong Min	Multi-agent Based Personal File Management Using Case Based Reasoning.	HAIS	2009	DBLP DOI BibTeX RDF
15	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto	Computing the Tutte Polynomial in Vertex-Exponential Time.	FOCS	2008	DBLP DOI BibTeX RDF
15	Igor Razgon, Barry O'Sullivan	Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract).	ICALP (1)	2008	DBLP DOI BibTeX RDF
15	Syuusuke Kuribara, Safia Abbas, Hajime Sawamura	Applying the Logic of Multiple-Valued Argumentation to Social Web: SNS and Wikipedia.	PRIMA	2008	DBLP DOI BibTeX RDF	Logic of Multiple-Valued Argumentation, Wikipedia, Argumentation, Social Web, SNS
15	Nuria Gómez Blas, Luis F. Mingo, Juan Castellanos	Networks of evolutionary processors with a self-organizing learning.	AICCSA	2008	DBLP DOI BibTeX RDF
15	Erik D. Demaine	Algorithmic Graph Minors and Bidimensionality.	IWPEC	2008	DBLP DOI BibTeX RDF
15	Igor B. Smirnov	Raw pointers in application classes of C++ considered harmful.	ACM SIGPLAN Notices	2007	DBLP DOI BibTeX RDF	dynamic storage, raw pointers, smart pointers, C++, C++, methodology
15	Martin V. Butz, David E. Goldberg, Pier Luca Lanzi, Kumara Sastry	Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity.	Genet. Program. Evolvable Mach.	2007	DBLP DOI BibTeX RDF	Solution sustenance, Learning classifier systems, XCS, Mutation, LCS, Niching, Markov chain analysis