Sylvia B. Encheva

dblp:42/846 · also Sylvia Encheva · DBLP profile ↗
← Back
58ranked-venue papers
47as first author
3since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 24 · 20 first-author · 3 since 2021Theory of computation · 11 · 6 first-authorArtificial intelligence and machine learning · 8 · 8 first-authorApplied, interdisciplinary, general and emerging computing · 8 · 8 first-authorDatabases, data management, data science and information retrieval · 6 · 6 first-authorSecurity and privacy · 3 · 1 first-author
YearPublicationVenuePosition
2023 Dynamic Secure Mesh for Collaborative Nodes of IoT Devices
Sylvia B. Encheva, Sharil Tumin
CDVE1
2022 Simple E2EE Secure Communication Protocol for Tiny IoT Devices
Sylvia B. Encheva, Sharil Tumin
CDVE1
2021 Cooperative Dynamic Programmable Devices Using Actor Model for Embedded Systems of Microcontrollers
Sylvia B. Encheva, Sharil Tumin
CDVE1
2019 Many Valued Logics Supporting Establishment of a New Research Structure in an Educational Organization
Sylvia B. Encheva, Tom Skauge
CDVE1
2018 Cooperative Decision Making for Resource Allocation
Sylvia B. Encheva
CDVE1
2018 Providing Sustainable Workforce for Care Services Through Citizen Collaboration
Sylvia B. Encheva, Sharil Tumin
CDVE1
2017 Detection of Troublesome Cases
Sylvia B. Encheva
WorldCIST (1)1
2017 Systematic Assignments in Merging Organizations
Sylvia B. Encheva
WorldCIST (2)1
2017 Ordering and Visualization of Recommendations
Sylvia B. Encheva
WorldCIST (2)1
2017 Attribute Dependencies and Complete Orderings
Sylvia B. Encheva
WorldCIST (2)1
2016 Supplier Selection Based on Recommendations
Sylvia B. Encheva
CDVE1
2016 Isotone Galois Connections and Employees Resource Management
Sylvia B. Encheva
CDVE1
2015 Knowledge Evaluation with Rough Sets
Sylvia B. Encheva, Torleiv Ese
ICIC (3)1
2013 Vague Sets and Closure Systems
Sylvia B. Encheva
KSEM1
2012 Rough Sets Methods for Working with Uncertainty
Sylvia B. Encheva
CDVE1
2012 Project Proposals Ranking Based on Closed Sets Properties
Sylvia B. Encheva, Sharil Tumin, Marina Z. Solesvik
CDVE1
2012 Simulation and Optimization in Collaborative Ship Design: Innovative Approach
Marina Z. Solesvik, Tatiana Iakovleva, Sylvia B. Encheva
CDVE3
2012 Ordering of Potential Collaboration Options
Sylvia B. Encheva
ICCCI (2)1
2011 Handling Different Format Initial Data in a Cooperative Decision Making Process
Sylvia B. Encheva
CDVE1
2010 Partial Orderings for Ranking Help Functions
Sylvia B. Encheva, Sharil Tumin
ACIIDS (2)1
2010 Cooperative Decision Making for Evaluating Ports' Reception Facilities
Sylvia B. Encheva, Sharil Tumin
CDVE1
2010 Web Engineering Process Matrix for Sustainable Deployment of Web-Based Applications
Sharil Tumin, Sylvia B. Encheva
CDVE2
2010 Diagnostic Tests Based on Knowledge States
Sylvia B. Encheva, Sharil Tumin
ICCCI (3)1
2009 Visualization of Cooperative Decision Making
Sylvia B. Encheva
CDVE1
2009 Partner Selection for Interfirm Collaboration: The Context of Ship Design
Marina Z. Solesvik, Sylvia B. Encheva
CDVE2
2008 Visualization of Cooperative Options for Small Maritime Companies
Sylvia B. Encheva, Sharil Tumin
CDVE1
2008 On Improving Quality of the Decision Making Process in a Federated Learning System
Sylvia B. Encheva, Sharil Tumin
CDVE1
2008 Cooperative User-Centric Digital Identity Management Framework for Public Web Portals
Sylvia B. Encheva, Sharil Tumin
CDVE1
2008 Inconsistency Management
Sylvia B. Encheva, Sharil Tumin
ICIC (3)1
2008 On Attaining Higher Level of Certainty in Evaluation Processes
Sylvia B. Encheva, Sharil Tumin
KES (1)1
2008 Collaboration Options for Small and Medium Size Enterprises
Sylvia B. Encheva, Sharil Tumin
KES (1)1
2008 On Drawing Conclusions in Presence of Inconsistent Data
Sylvia B. Encheva, Sharil Tumin
KES-AMSTA1
2007 Application of Paraconsistent Logic in an Intelligent Tutoring System
Sylvia B. Encheva, Sharil Tumin, Marina Z. Solesvik
CDVE1
2007 Lattices and the Collaborative Design in Shipbuilding
Marina Z. Solesvik, Sylvia B. Encheva, Sharil Tumin
CDVE2
2007 Non-classical Logic in an Intelligent Assessment Sub-system
Sylvia B. Encheva, Yuriy P. Kondratenko, Sharil Tumin, Sanjay Kumar Khattri
ICCSA (1)1
2007 Application of Paraconsistent Annotated Logic in Intelligent Systems
Sylvia B. Encheva, Sharil Tumin, Yuriy P. Kondratenko
ICIC (1)1
2006 Automated Discovering of What is Hindering the Learning Performance of a Student
Sylvia B. Encheva, Sharil Tumin
APWeb1
2006 Sharing Protected Web Resources Using Distributed Role-Based Modeling
Sylvia B. Encheva, Sharil Tumin
APWeb1
2006 Application of Association Rules for Finding Correlations Among Students Preliminary Knowledge
Sylvia B. Encheva, Sharil Tumin
CDVE1
2005 Cooperative Shared Learning Objects in an Intelligent Web-Based Tutoring System Environment
Sylvia B. Encheva, Sharil Tumin
CDVE1
2005 Response-Driven Web-Based Assessment System
Sylvia B. Encheva, Sharil Tumin
KES (3)1
2005 On Projective Codes Satisfying the Chain Condition
abstract
Projective codes with length above the Griesmer bound that satisfy the chain condition are discussed. Necessary and sufficient conditions for binary linear codes for which the chain condition holds are derived.
Sylvia B. Encheva
SIAM J. Discret. Math.1
2004 Collaborative Role Management for Sharing Protected Web Resources
Sylvia B. Encheva, Sharil Tumin
CDVE1
2003 Intersecting Codes and Separating Codes
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
Discret. Appl. Math.2
2003 Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
Discret. Appl. Math.2
2002 Frameproof codes against limited coalitions of pirates
Sylvia B. Encheva, Gérard D. Cohen
Theor. Comput. Sci.1
2002 More on (2,2)-separating systems
abstract
The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2,2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.
Gérard D. Cohen, Sylvia B. Encheva, Hans Georg Schaathun
IEEE Trans. Inf. Theory2
2001 A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
abstract
Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x 1 , . . . ,x t if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all i=1, . . . ,n. A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We prove that for any $t\le q-1$ there exist sequences of such codes with asymptotically nonvanishing rate.
Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor
SIAM J. Discret. Math.3
2000 Linear Codes and Their Coordinate Ordering
Sylvia B. Encheva, Gérard D. Cohen
Des. Codes Cryptogr.1
2000 On self-dual ternary codes and their coordinate ordering
Sylvia B. Encheva, Gérard D. Cohen
Inf. Sci.1
1999 Antichain Codes
Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor
Des. Codes Cryptogr.2
1999 On Linear Projective Codes Which Satisfy the Chain Condition
Sylvia B. Encheva, Gérard D. Cohen
Inf. Sci.1
1999 On binary constructions of quantum codes
abstract
We improve estimates on the parameters of quantum codes obtained by Steane's (see ibid., vol.45, no.7, p.2492-5, 1999) construction from binary codes. This yields several new families of quantum codes.
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
IEEE Trans. Inf. Theory2
1999 Constructions of Intersecting Codes
abstract
New constructions of binary linear intersecting codes are presented. Some codes with high distances are shown to be intersecting.
Sylvia B. Encheva, Gérard D. Cohen
IEEE Trans. Inf. Theory1
1996 On binary linear codes which satisfy the two-way chain condition
abstract
General constructions of binary linear codes satisfying the two-way chain condition are found. Sufficient conditions for their existence are determined. Some of these codes are proven to be Z/sub 4/-linear. An expression for their state complexity profile is also found. Cases, when such codes have covering radius R=t[n, k] are shown.
Sylvia B. Encheva
IEEE Trans. Inf. Theory1
1996 Optimal binary linear codes and Z4-linearity
abstract
We give necessary and sufficient conditions for a binary linear code to be Z/sub 4/-linear. Especially we treat optimal, binary linear codes and determine all such codes with minimum weight less or equal to six which are Z/sub 4/-linear.
Sylvia B. Encheva, Helge Elbrønd Jensen
IEEE Trans. Inf. Theory1
1994 On the [28, 7, 12] Binary Self-Complementary Codes and Their Residuals
Stefan M. Dodunekov, Sylvia B. Encheva, Stoyan N. Kapralov
Des. Codes Cryptogr.2
1994 Codes satisfying the chain condition
abstract
The authors considered weight hierarchies of codes satisfying the chain condition, they called these chain-good. First, they gave a set of simple necessary conditions for a sequence to be chain-good. They proved that given one chain-good sequence, there is an infinite set of chain-good sequences that can be constructed from this one sequence. Finally, they used this result to completely describe the sets of chain-good sequences of dimensions up to 5.>
Sylvia B. Encheva, Torleiv Kløve
IEEE Trans. Inf. Theory1