Search results for "characterizations"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Isabel Oitavem	Implicit Characterizations of Pspace.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF	implicit characterizations, computational complexity, term rewriting, Pspace
50	Benjamin J. Ewy, Joseph B. Evans, Victor Frost, Gary J. Minden	TCP/ATM Experiences in the MAGIC Testbed.	HPDC	1995	DBLP DOI BibTeX RDF	TCP/ATM, MAGIC testbed, cell level pacing, bandwidth capacity, high performance distributed systems, traffic management infrastructureThe limited applicability of block decomposition in cluster computing - Crandall, P.E. Dept. of Comput, Sci. & Eng., Connecticut Univ., Storrs, USA This Paper Appears in : High Performance Distributed Computing, 1995., Proceedings of the Fourth IEEE International Symposium on on Pages: 102 - 109 This Conference was Held : 2-4 Aug. 1995 1995 ISBN: 0-8186-7088-6 IEEE Catalog Number: 95TB8075 Total Pages: xiv+246 Refer, Mathematical characterizations of the communication costs for contiguous partitioning and block decomposition in both a ring-connected and switched network are presented, Simulations of ring and switch technologies indicate that as network speeds increase and as the effects of message-preparation latency dominate, the advantages claimed for block decomposition diminish, Subject Terms: FDDI, block decomposition, high-speed switch technology, mathematical characterizations, contiguous partitioning, ring-connected networks, simulations, performance evaluation, performance evaluation, performance, asynchronous transfer mode, congestion control, cluster computing, local area networks, transport protocols, performance measurements, wide area networks, CT, switched network, FDDI, congestion avoidance, token networks
48	Tali Kaufman, Madhu Sudan 0001	Algebraic property testing: the role of invariance.	STOC	2008	DBLP DOI BibTeX RDF	error-correcting codes, locally testable codes, sublinear time algorithms
46	Shahar Dobzinski, Mukund Sundararajan	On characterizations of truthful mechanisms for combinatorial auctions and scheduling.	EC	2008	DBLP DOI BibTeX RDF	scheduling, combinatorial auctions, characterizations, incentive compatibility
40	Kohtaro Tadaki	Partial Randomness and Dimension of Recursively Enumerable Reals.	MFCS	2009	DBLP DOI BibTeX RDF	recursively enumerable real, partial randomness, Chaitin ? number, program-size complexity, universal probability, dimension, algorithmic randomness
38	Michael R. Fellows, Michael A. Langston	An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	obstruction sets, computing finite-basis characterizations, graph-theoretic analog, Myhill-Nerode characterization, computability, regular languages
37	A. R. Doagooei, Hossein Mohebi	Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 49R50, 47A56, 15A18
37	Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda	Uniform Characterizations of Polynomial-Query Learnabilities.	Discovery Science	1998	DBLP DOI BibTeX RDF
37	Kenneth C. Sevcik	Characterizations of Parallelism in Applications and Their Use In Scheduling.	SIGMETRICS	1989	DBLP DOI BibTeX RDF
33	Peter L. Hammer, Alexander Kogan	Essential and redundant rules in Horn knowledge bases.	HICSS (3)	1995	DBLP DOI BibTeX RDF	redundant rules, essential rules, Horn knowledge bases, logically equivalent transformations, irredundant prime knowledge base, future simplifications, combinatorial characterizations, computational recognition procedures, essentiality, knowledge based systems, redundancy, redundancy, production rule, Horn clauses, combinatorial mathematics
33	Phyllis Crandall	The Limited Applicability of Block Decomposition in Cluster Computing.	HPDC	1995	DBLP DOI BibTeX RDF	block decomposition, high-speed switch technology, mathematical characterizations, contiguous partitioning, ring-connected networks, simulations, performance evaluation, cluster computing, switched network, FDDI, FDDI, token networks
32	Heping Gao, Meera Sitharam	Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces.	SAC	2009	DBLP DOI BibTeX RDF	Henneberg-I graph, combinatorial rigidity, geometric constraints and reasoning, graph characterization, one degree of freedom (1-dof), quadratic or radical solvability, triangle-decomposable or tree-decomposable graph, underconstrained geometric constraint solving, computer aided design, mechanism, linkage, graph minor, algebraic complexity, configuration space
32	Themba Dube, Joanne Walters-Wayland	Weakly Pseudocompact Frames.	Appl. Categorical Struct.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 06D22, 54C25, 54D20, 54D35
32	Eddie Kohler, Jinyang Li 0001, Vern Paxson, Scott Shenker	Observed structure of addresses in IP traffic.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	address structures, IP, network measurement, multifractals, address space
32	Eddie Kohler, Jinyang Li 0001, Vern Paxson, Scott Shenker	Observed structure of addresses in IP traffic.	Internet Measurement Workshop	2002	DBLP DOI BibTeX RDF	IP
32	Edward Y. Chang, Zohar Manna, Amir Pnueli	Characterization of Temporal Property Classes.	ICALP	1992	DBLP DOI BibTeX RDF
29	Eskandar Naraghirad	Characterizations of simultaneous farthest point in normed linear spaces with applications.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Proximinal set, Simultaneous farthest point, Simultaneous remotal set, Extremal point, Best approximation
29	Michel Couprie, Gilles Bertrand 0001	New Characterizations of Simple Points in 2D, 3D, and 4D Discrete Spaces.	IEEE Trans. Pattern Anal. Mach. Intell.	2009	DBLP DOI BibTeX RDF
29	Balder ten Cate, Phokion G. Kolaitis	Structural characterizations of schema-mapping languages.	ICDT	2009	DBLP DOI BibTeX RDF	data integration, data exchange, schema mapping, definability
29	Jean-Yves Marion, Romain Péchoux	Characterizations of polynomial complexity classes with a better intensionality.	PPDP	2008	DBLP DOI BibTeX RDF	quasi-interpretation, resource upper bounds, sup-interpretation, static analysis
29	Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran	Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.	FoIKS	2008	DBLP DOI BibTeX RDF
29	Marc Gyssens, Jan Paredaens, Dirk Van Gucht, George H. L. Fletcher	Structural characterizations of the semantics of XPath as navigation tool on a document.	PODS	2006	DBLP DOI BibTeX RDF	XPath, expressibility, definability
29	Hans L. Bodlaender	Treewidth: Characterizations, Applications, and Computations.	WG	2006	DBLP DOI BibTeX RDF
29	Min Chih Lin, Jayme Luiz Szwarcfiter	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
29	Tero Harju	Characterizations of Regularity.	FSMNLP	2005	DBLP DOI BibTeX RDF
29	Stefan Woltran	Characterizations for Relativized Notions of Equivalence in Answer Set Programming.	JELIA	2004	DBLP DOI BibTeX RDF
29	Georg Gottlob, Nicola Leone, Francesco Scarcello	Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
29	Xiao Jun Chen, Rocco De Nicola	Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures.	ICALP	1996	DBLP DOI BibTeX RDF
29	Darrell Suggs, Robert G. Reynolds	Constructing multiprocessor workload characterizations.	ACM Southeast Regional Conference	1995	DBLP DOI BibTeX RDF
29	Shoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka	Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes.	CONCUR	1994	DBLP DOI BibTeX RDF
29	Gösta Grahne, Kari-Jouko Räihä	Dependency Characterizations for Acyclic Database Schemes.	PODS	1984	DBLP DOI BibTeX RDF
29	Seppo Sippu, Eljas Soisalon-Soininen	Characterizations of the LL(k) Property.	ICALP	1980	DBLP DOI BibTeX RDF
26	Sergey Bereg	On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane.	Graphs Comb.	2009	DBLP DOI BibTeX RDF
25	Dawn J. Lawrie, Henry Feild, David W. Binkley	Quantifying identifier quality: an analysis of trends.	Empir. Softw. Eng.	2007	DBLP DOI BibTeX RDF	Software quality characterizations, Program analysis, Source code
25	Orla Greevy, Stéphane Ducasse, Tudor Gîrba	Analyzing Feature Traces to Incorporate the Semantics of Change in Software Evolution Analysis.	ICSM	2005	DBLP DOI BibTeX RDF	feature history, transitions of characterizations, reverse engineering, software evolution, dynamic analysis
25	Michel Rigo	Characterizing Simpler Recognizable Sets of Integers.	Stud Logica	2004	DBLP DOI BibTeX RDF	Star-free languages, recognizable sets of integers, numeration systems, logical characterizations
24	Themba Dube	A Little More on Coz-Unique Frames.	Appl. Categorical Struct.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 06D22, 54C25, 54D20
24	Jean-Yves Marion, Romain Péchoux	A Characterization of NCk.	TAMC	2008	DBLP DOI BibTeX RDF
24	Joshua Wingstrom, Henri Casanova	Probabilistic allocation of tasks on desktop grids.	IPDPS	2008	DBLP DOI BibTeX RDF
24	Gerardo Vega	Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given.	WAIFI	2007	DBLP DOI BibTeX RDF	One-weight cyclic codes, linear recurring sequences, exponential sums and Gaussian sums
24	Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter	Proper Helly Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF	Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
24	Walid Belkhir, Luigi Santocanale	Undirected Graphs of Entanglement 2.	FSTTCS	2007	DBLP DOI BibTeX RDF
24	James Cheney	The Semantics of Nominal Logic Programs.	ICLP	2006	DBLP DOI BibTeX RDF
24	Manfred Kufleitner	Polynomials, Fragments of Temporal Logic and the Variety DA over Traces.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
24	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes	Online auctions with re-usable goods.	EC	2005	DBLP DOI BibTeX RDF
24	Greg S. Schmidt, Sue-Ling Chen, Aaron N. Bryden, Mark A. Livingston, Lawrence J. Rosenblum, Bryan R. Osborn	Multidimensional Visual Representations for Underwater Environmental Uncertainty.	IEEE Computer Graphics and Applications	2004	DBLP DOI BibTeX RDF
24	Neelesh Korade, S. Arun-Kumar	A Logical Characterization of Efficiency Preorders.	ICTAC	2004	DBLP DOI BibTeX RDF	efficiency preorders, Hennessy-Milner Logic, Concurrency, bisimulation, transition systems, process efficiency
24	Jérémie Chalopin, Yves Métivier	Election and Local Computations on Edges.	FoSSaCS	2004	DBLP DOI BibTeX RDF
24	Li Jiao, To-Yat Cheung, Weiming Lu	Characterizing Liveness of Petri Nets in Terms of Siphons.	ICATPN	2002	DBLP DOI BibTeX RDF	Asymmetric choice net, liveness monotonicity, siphon, Petri net, live, characterization, homogeneous
24	Philipp Rohde	Expressive Power of Monadic Second-Order Logic and Modal µ-Calculus.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
24	Antonio M. López 0001, Felipe Lumbreras, Joan Serrat 0002, Juan José Villanueva	Evaluation of Methods for Ridge and Valley Detection.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	separatrices, drainage patterns, comparative analysis, Creases
24	Deborah Joseph, Meera Sitharam	Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra.	STACS	1990	DBLP DOI BibTeX RDF
21	Jeroen Schillewaert, Joseph A. Thas	Characterizations of Hermitian varieties by intersection numbers.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	51A45, 51A50, 05B25, 51E12, AMS Classifications 51E20
21	Boris S. Mordukhovich	Characterizations of linear suboptimality for mathematical programs with equilibrium constraints.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C30, 49J52, 49J53
21	Kaoru Onodera	New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality.	LATA	2009	DBLP DOI BibTeX RDF
21	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification, 68Q15
21	Chris D. Godsil, Aidan Roy	Two Characterizations of Crooked Functions.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
21	Mohamed Yagoubi, Anis Bouali, Philippe Chevrel	Multiobjective controller synthesis for parameter dependent descriptor systems via dilated LMI characterizations.	CDC	2008	DBLP DOI BibTeX RDF
21	Mikolaj Bojanczyk	Effective characterizations of tree logics.	PODS	2008	DBLP DOI BibTeX RDF
21	Xiyang Li, Cong Qin	Combinatorial Characterizations of k-Coincidence Frequency-Hopping Sequences.	CSSE (3)	2008	DBLP DOI BibTeX RDF
21	Michel Couprie, Gilles Bertrand 0001	New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces.	DGCI	2008	DBLP DOI BibTeX RDF
21	Haitao Li, Dunyan Yan	Characterizations of multi-knot piecewise linear spectral sequences.	Adv. Comput. Math.	2007	DBLP DOI BibTeX RDF	AMS 2000 subject classification 42C15
21	Augusto Parma, Roberto Segala	Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.	FoSSaCS	2007	DBLP DOI BibTeX RDF
21	Zhenfu Cao, Gennian Ge, Ying Miao 0001	Combinatorial characterizations of one-coincidence frequency-hopping sequences.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS Classifications 94A05, 05B30
21	Liliana Cojocaru	Characterizations of CD Grammar Systems Working in Competence Mode by Multicounter Machine Resources.	Ershov Memorial Conference	2006	DBLP DOI BibTeX RDF
21	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	MFCS	2006	DBLP DOI BibTeX RDF
21	Maarten Marx, Maarten de Rijke	Semantic characterizations of navigational XPath.	SIGMOD Rec.	2005	DBLP DOI BibTeX RDF	XML
21	Brian Curtin	Algebraic Characterizations of Graph Regularity Conditions.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF
21	Guofang Qiu, Wen-Xiu Zhang, Wei-Zhi Wu 0001	Characterizations of Attributes in Generalized Approximation Representation Spaces.	RSFDGrC (1)	2005	DBLP DOI BibTeX RDF
21	Rafael Pass, Abhi Shelat	Unconditional Characterizations of Non-interactive Zero-Knowledge.	CRYPTO	2005	DBLP DOI BibTeX RDF
21	B. N. Waphare, Vinayak Joshi	Characterizations of Standard Elements in Posets.	Order	2004	DBLP DOI BibTeX RDF	distributive pair, semi-distributive pair, modular pair, standard element, distributive element, ?-standard element and p-element
21	Emmanuel Godard, Yves Métivier, Anca Muscholl	Characterizations of Classes of Graphs Recognizable by Local Computations.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
21	José L. Balcázar, Jaume Baixeries	Characterizations of Multivalued Dependencies and Related Expressions.	Discovery Science	2004	DBLP DOI BibTeX RDF
21	David Richerby	Logical Characterizations of PSPACE.	CSL	2004	DBLP DOI BibTeX RDF	choice operators, partial fixed points, descriptive complexity, Finite model theory
21	Maria Bras-Amorós	Improvements to Evaluation Codes and New Characterizations of Arf Semigroups.	AAECC	2003	DBLP DOI BibTeX RDF
21	Ricard Gavaldà, Denis Thérien	Algebraic Characterizations of Small Classes of Boolean Functions.	STACS	2003	DBLP DOI BibTeX RDF
21	Thomas Lukasiewicz	Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics.	LPNMR	2001	DBLP DOI BibTeX RDF
21	Jie-lü Xu, Hanliang Xu, Yan Wang, Shuwang Lü	Equivalent Characterizations and Applications of Multi-output Correlation-Immune Boolean Functions.	ICICS	2001	DBLP DOI BibTeX RDF
21	Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama	Compositional Characterizations of lambda-Terms Using Intersection Types.	MFCS	2000	DBLP DOI BibTeX RDF
21	Hajime Ishihara	Function algebraic characterizations of the polytime functions.	Comput. Complex.	1999	DBLP DOI BibTeX RDF	Polytime functions, function algebras, recursion schemes
21	Lonnie R. Welch, Paul V. Werme, Larry A. Fontenot, Michael W. Masters, Behrooz A. Shirazi, Binoy Ravindran, D. Wayne Mills	Adaptive QoS and Resource Management using a Posteriori Workload Characterizations.	IEEE Real Time Technology and Applications Symposium	1999	DBLP DOI BibTeX RDF
21	Billy K. H. Wong, Henry Shu-Hung Chung	Modular graphing technique for small-signal low-frequency characterizations of PWM DC/DC regulators.	ISCAS (5)	1999	DBLP DOI BibTeX RDF
21	Jorge Castro, Carlos Seara	Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2.	STACS	1992	DBLP DOI BibTeX RDF
21	Douglas R. Stinson	Combinatorial Characterizations of Authentication Codes.	CRYPTO	1991	DBLP DOI BibTeX RDF
21	Bernhard Steffen, Jens Knoop	Finite Constants: Characterizations of a New Decidable Set of Constants.	MFCS	1989	DBLP DOI BibTeX RDF
21	Eric Allender	Characterizations on PUNC and Precomputation (Extended Abstract).	ICALP	1986	DBLP DOI BibTeX RDF
21	Klaus-Jörn Lange	Two Characterizations of the Logarithmic Alternation Hierarchy.	MFCS	1986	DBLP DOI BibTeX RDF
21	Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier	Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.	ICALP	1984	DBLP DOI BibTeX RDF
21	Matthew S. Hecht, Jeffrey D. Ullman	Characterizations of Reducible Flow Graphs.	J. ACM	1974	DBLP DOI BibTeX RDF
16	Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan	Characterizing schema mappings via data examples.	PODS	2010	DBLP DOI BibTeX RDF	data examples, data integration, data exchange, schema mappings
16	Swagato Sanyal, Raja S 0001, Somenath Biswas	Necessary and sufficient conditions for success of the metropolis algorithm for optimization.	GECCO	2010	DBLP DOI BibTeX RDF	rapid mixing of markov chains, success of markov chain families, optimization, metropolis algorithm
16	Mohammed Belkhatir	An operational model based on knowledge representation for querying the image content with concepts and relations.	Multim. Tools Appl.	2009	DBLP DOI BibTeX RDF	Semantic/Relational integration, Knowledge representation formalisms, Precision/Recall validation, Conceptual graphs, Image indexing and retrieval
16	Hung Gia Hoang, Hoang Duong Tuan, Truong Q. Nguyen	Frequency-Selective KYP Lemma, IIR Filter, and Filter Bank Design.	IEEE Trans. Signal Process.	2009	DBLP DOI BibTeX RDF
16	Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz	Wreath Products of Forest Algebras, with Applications to Tree Logics.	LICS	2009	DBLP DOI BibTeX RDF
16	Debprakash Patnaik, Manish Marwah, Ratnesh K. Sharma, Naren Ramakrishnan	Sustainable operation and management of data center chillers using temporal data mining.	KDD	2009	DBLP DOI BibTeX RDF	chillers, clustering, sustainability, data centers, motifs, frequent episodes
16	Mikolaj Bojanczyk	Algebra for Tree Languages.	CSL	2009	DBLP DOI BibTeX RDF
16	Robert Lorenz 0001, Gabriel Juhás, Sebastian Mauser	Partial Order Semantics of Types of Nets.	SOFSEM	2009	DBLP DOI BibTeX RDF
16	Alexander Klippel, Rui Li 0023	The Endpoint Hypothesis: A Topological-Cognitive Assessment of Geographic Scale Movement Patterns.	COSIT	2009	DBLP DOI BibTeX RDF
16	Ilkka Niemelä	Stable models and difference logic.	Ann. Math. Artif. Intell.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68N17, 68T27
16	Rajeev Alur, Aditya Kanade, Gera Weiss	Ranking Automata and Games for Prioritized Requirements.	CAV	2008	DBLP DOI BibTeX RDF