Search results for "Theoretical Computer Science"

showing 10 items of 1151 documents

The b-chromatic number of power graphs

2003

The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

b-chromatic numberGeneral Computer Science[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]power graphTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsChromatic scaleGraph coloringcoloringMathematicscycle and complete binary treeMathematics::CombinatoricsBinary treelcsh:Mathematicscycle and complete binary tree.path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Complete coloringlcsh:QA1-939Vertex (geometry)Brooks' theorem[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringFractional coloringDiscrete Mathematics & Theoretical Computer Science
researchProduct

Convergence Analysis of Distributed Set-Valued Information Systems

2016

This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not rep- resented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the net- work is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distr…

boolean dynamic systems0209 industrial biotechnologyClass (set theory)Geographic information systemTheoretical computer scienceBinary encoding boolean dynamic systems con- sensus algorithms convergence cooperative systems distributed information systems set-valued dynamic maps.consensus algorithms02 engineering and technologyBoolean algebraSet (abstract data type)symbols.namesakecooperative systems020901 industrial engineering & automationSettore ING-INF/04 - AutomaticaConvergence (routing)0202 electrical engineering electronic engineering information engineeringInformation systemElectrical and Electronic EngineeringMathematicsReal numberconvergencebusiness.industryset-valued dynamic mapsComputer Science Applications1707 Computer Vision and Pattern Recognitiondistributed information systemsComputer Science ApplicationsLocal convergenceControl and Systems EngineeringsymbolsBinary encoding; boolean dynamic systems; consensus algorithms; convergence; cooperative systems; distributed information systems; set-valued dynamic maps; Electrical and Electronic Engineering; Control and Systems Engineering; Computer Science Applications1707 Computer Vision and Pattern RecognitionBinary encoding020201 artificial intelligence & image processingbusinessIEEE Transactions on Automatic Control
researchProduct

An inductive inference approach to classification

1994

Abstract In this paper we introduce a formal framework for investigating the relationship of inductive inference and the task of classification. We give the first results on the relationship between functions that can be identified in the limit and functions that can be acquired from unclassified objects only. Moreover, we present results on the complexity of classification functions and the preconditions necessary in order to allow the computation of such functions.

business.industryComputer scienceComputationInductive reasoningMachine learningcomputer.software_genreTheoretical Computer ScienceTask (project management)Order (biology)Artificial IntelligenceArtificial intelligenceLimit (mathematics)businesscomputerSoftwareJournal of Experimental & Theoretical Artificial Intelligence
researchProduct

Automatic multi-seed detection for MR breast image segmentation

2017

In this paper an automatic multi-seed detection method for magnetic resonance (MR) breast image segmentation is presented. The proposed method consists of three steps: (1) pre-processing step to locate three regions of interest (axillary and sternal regions); (2) processing step to detect maximum concavity points for each region of interest; (3) breast image segmentation step. Traditional manual segmentation methods require radiological expertise and they usually are very tiring and time-consuming. The approach is fast because the multi-seed detection is based on geometric properties of the ROI. When the maximum concavity points of the breast regions have been detected, region growing and m…

business.industryComputer scienceComputer Science (all)Pattern recognitionImage segmentationGold standard (test)Breast MR030218 nuclear medicine & medical imagingTheoretical Computer Science03 medical and health sciencesSeed detection0302 clinical medicineRegion of interestRegion growing030220 oncology & carcinogenesisManual segmentationSegmentationSensitivity (control systems)Artificial intelligenceAutomatic segmentationMr imagesbusinessMaximum concavity point
researchProduct

An Innovative Similarity Measure for Sentence Plagiarism Detection

2016

We propose and experimentally assess Semantic Word Error Rate (SWER), an innovative similarity measure for sentence plagiarism detection. SWER introduces a complex approach based on latent semantic analysis, which is capable of outperforming the accuracy of competitor methods in plagiarism detection. We provide principles and functionalities of SWER, and we complement our analytical contribution by means of a significant preliminary experimental analysis. Derived results are promising, and confirm to use the goodness of our proposal.

business.industryComputer scienceLatent semantic analysisPlagiarism DetectionComputer Science (all)Sentence similarity measureWord error rate02 engineering and technologySimilarity measurecomputer.software_genreComplement (complexity)Theoretical Computer SciencePlagiarism detection020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingPlagiarism detectionArtificial intelligenceSentence Similarity MeasurebusinesscomputerNatural language processingSentencePlagiarism detection; Sentence similarity measure; Theoretical Computer Science; Computer Science (all)
researchProduct

A learning model for the dual evolution of human social behaviors

2003

In this work we modelize, with an abstract mathematical model by computer simulation, the processes that have made to appear in the world a strong duality between orient and occident, by combining changes in conditions of initialization, natural system and the opposition gregarious/individualism of the social behaviors. Finally we present a statistical study of the influence of the repression adaptability, resignation and recycling on the ecological destruction and social evolution. This model can help us to analyze if the current capitalist globalization can be stopped, changed or regulated, and if it is possible to overcome it towards a Free Scientific Society.

business.industryComputer sciencemedia_common.quotation_subjectOpposition (politics)DUAL (cognitive architecture)AdaptabilityTheoretical Computer ScienceGlobalizationIndividualismControl and Systems EngineeringComputer Science (miscellaneous)CyberneticsArtificial intelligencePositive economicsSocial evolutionbusinessEngineering (miscellaneous)Social Sciences (miscellaneous)Social behaviormedia_commonKybernetes
researchProduct

A new family of nonstochastic languages

2010

Öz bulunamadı.

business.industrySignal ProcessingTheory of computationInformation processingArtificial intelligenceLanguage familybusinessComputer Science ApplicationsInformation SystemsTheoretical Computer ScienceMathematicsInformation Processing Letters
researchProduct

Using Induced Ordered Weighted Averaging (IOWA) Operators for Aggregation in Cross-Efficiency Evaluations

2014

This paper proposes an enhancement of the cross-efficiency evaluation through the aggregation of cross-efficiencies by using a particular type of induced ordered weighted averaging IOWA operator. The use of a weighted average of cross-efficiencies for the calculation of the cross-efficiency scores, instead of the usual arithmetic mean, allows us to introduce some flexibility into the analysis. In particular, the main purpose of the approach we present is to provide aggregation weights that reflect the decision maker DM preferences regarding the relative importance that should be attached to the cross-efficiencies provided by the different decision-making units. To do it, an ordering is to b…

business.industryType (model theory)Theoretical Computer ScienceHuman-Computer InteractionVariable (computer science)Matrix (mathematics)Operator (computer programming)Artificial IntelligenceArtificial intelligencebusinessOrdered weighted averaging aggregation operatorWeighted arithmetic meanAlgorithmRowSoftwareMathematicsArithmetic meanInternational Journal of Intelligent Systems
researchProduct

A comparison study of evolutive algorithms for solving the partitioning problem in distributed virtual environment systems

2004

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3D avatars) to the servers in the system. In this paper, we present a comparison study of different modern heuristics for solving the partitioning problem in DVE systems, as an alternative to the ad hoc heuristic proposed in the literature. Performance evaluation results show that some…

business.product_categoryComputer Networks and CommunicationsComputer scienceHeuristic (computer science)Distributed computingcomputer.software_genreKey issuesComputer Graphics and Computer-Aided DesignTheoretical Computer ScienceArtificial IntelligenceHardware and ArchitectureVirtual machineServerScalabilityComparison studyInternet accessHeuristicsbusinesscomputerSoftwareParallel Computing
researchProduct

Robust technique for 3D shape reconstruction

2017

Abstract In this paper a robust and simple scheme is presented for three dimensional (3D) shape reconstruction of real object. A novel composite pattern technique is proposed for projecting the light pattern on the object of interest. The proposed scheme reduces the number of patterns by combining the primary color coded channels into one composite format. Our approach uses both spatial and temporal intensity variation for calibration and construction phase. Gamma calibration is considered with the propose scheme. High quality depth map is obtained from the linear light reflected by the shape of object without complex calculations. Experimental results demonstrated that proposed technique i…

business.product_categoryGeneral Computer Sciencebusiness.industry3D reconstructionFlashlight02 engineering and technology01 natural sciencesTheoretical Computer ScienceStructured-light 3D scanner010309 opticsDepth mapModeling and Simulation0103 physical sciences0202 electrical engineering electronic engineering information engineeringCalibration020201 artificial intelligence & image processingComputer visionArtificial intelligenceComposite patternbusinessDigital cameraStructured lightMathematicsJournal of Computational Science
researchProduct