• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 206
Next 10 →

Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time

by Peter Eades, Seok-hee Hong, Naoki Katoh, Pascal Schweitzer, Yusuke Suzuki
"... A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. A 1-planar graph on n vertices can have at most 4n − 8 edges. It is known that testing 1-planarity of a graph is NP-complete. A 1-planar embedding of a graph G is maximal, if no edge can be added witho ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
of testing maximal 1-planarity of a graph G can be solved in linear time, if a rotation system Φ (i.e., the circular ordering of edges for each vertex) is given. We also prove that there is at most one maximal 1-planar embedding ξ of G that preserves the given rotation system Φ, and our algorithm also

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

by M. A. Bekos, S. Cornelsen, L. Grilli, S.-H. Hong, M. Kaufmann , 2014
"... Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it ..."
Abstract - Add to MetaCart
if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a polynomial-time algorithm to test whether a given graph is maximal outer-fan-planar

A Numerical Study of the Lorenz and Lorenz-Stenflo Systems

by Tommy Ekola, Tryck Universitetsservice, Us Ab
"... ges till offentlig granskning för avläggande av teknologie doktorsexamen fredagen ..."
Abstract - Add to MetaCart
ges till offentlig granskning för avläggande av teknologie doktorsexamen fredagen

Theoretical Foundations of Equitability and the Maximal Information Coefficient

by unknown authors , 2014
"... The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing ..."
Abstract - Add to MetaCart
The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing

ANY-TIME FUZZY CONTROLLER

by Edward Shmukler, Dr. Gal, A. Kaminka , 2006
"... Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and real-time behavior becomes more difficult. This thesis introduces an any-time fuzzy controller. Much work has been done ..."
Abstract - Add to MetaCart
to optimize and speed up a controlling process, however none of the existing solutions provides an any-time behavior. This study first introduces several constraints that should be satisfied in order to guarantee an any-time behavior. These constraints are related to aggregation and defuzzification phases

CERTIFICATE OF APPROVAL

by Yunlong Liu, Yunlong Liu, Erwei Bai, Mona K. Garvin, Hantao Zhang , 2014
"... Treatment plan optimization for rotating-shield brachytherapy ..."
Abstract - Add to MetaCart
Treatment plan optimization for rotating-shield brachytherapy

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond

Query Evaluation with Constant Delay

by Thèse De Doctorat, Normale Supérieure, De Cachan, Présentée Par, Monsieur Wojciech Kazana, Docteur De, Supérieure De Cachan, Nicole Bidoit, Professeur Président, Arnaud Durand, Patrice Ossona, Mendez Chargé, Victor Vianu, Professeur Examinateur, Luc Segoufin, Directeur Recherche Directeur
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract - Add to MetaCart
Parents, who directed me to follow the scientific path and where fully supportive at all times. Thanks to all the members of LSV – it was a pleasure working with You. I would like to thank the awesome people whom I have been working with in the same office on the 4th floor. Without all the nice riddles

POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR

by Dominique Tschopp, Prof E. Telatar, Prof S. Diggavi, Prof M. Grossglauser, Prof J. -y, Le Boudec, Prof M. Mitzenmacher, Prof S. Shakkottai
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Abstract - Add to MetaCart
2010 to my wife, Joyce, and my family...- Résumé-

On the validity of the Boltzmann equation for short range potentials

by Piazzale Aldo Moro
"... ABSTRACT. We consider a classical system of point particles interacting by means of a short range potential. We prove that, in the low–density (Boltzmann–Grad) limit, the system behaves, for short times, as predicted by the associated Boltzmann equation. This is a revisitation and an extension of th ..."
Abstract - Add to MetaCart
ABSTRACT. We consider a classical system of point particles interacting by means of a short range potential. We prove that, in the low–density (Boltzmann–Grad) limit, the system behaves, for short times, as predicted by the associated Boltzmann equation. This is a revisitation and an extension
Next 10 →
Results 1 - 10 of 206
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University