Pages that link to "Item:Q107189"
From MaRDI portal
The following pages link to Journal of Computer and System Sciences (Q107189):
Displaying 50 items.
- A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (Q107192) (← links)
- Discovery of optimal factors in binary data via a novel method of matrix decomposition (Q131470) (← links)
- Special issue on trajectory-based behaviour analytics (Q252695) (← links)
- Identifying locations from geospatial trajectories (Q252699) (← links)
- Discovery of stop regions for understanding repeat travel behaviors of moving objects (Q252706) (← links)
- Self-regularized causal structure discovery for trajectory-based networks (Q252712) (← links)
- On list update with locality of reference (Q269460) (← links)
- Implementing set objects in dynamic distributed systems (Q269463) (← links)
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Cloud-based automatic test data generation framework (Q269474) (← links)
- Tractability frontiers of the partner units configuration problem (Q269477) (← links)
- Comment on ``A strong provably secure IBE scheme without bilinear map'' by M. Zheng, Y. Xiang and H. Zhou (Q269479) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- On the finite and general implication problems of independence atoms and keys (Q269507) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Equations over sets of integers with addition only (Q295632) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- An efficient time-free solution to SAT problem by P systems with proteins on membranes (Q295645) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Fast processing of graph queries on a large database of small and medium-sized data graphs (Q295652) (← links)
- Approximately counting locally-optimal structures (Q295655) (← links)
- Special issue on cyber security in the critical infrastructure: advances and future directions (Q314786) (← links)
- A polytope-based approach to measure the impact of events against critical infrastructures (Q314790) (← links)
- A dynamic prime number based efficient security mechanism for big sensing data streams (Q314794) (← links)
- Reducing false positives of network anomaly detection by local adaptive multivariate smoothing (Q314797) (← links)
- Modeling and performance evaluation of stealthy false data injection attacks on smart grid in the presence of corrupted measurements (Q314801) (← links)
- A new universal designated verifier transitive signature scheme for big graph data (Q314806) (← links)
- Secure and efficient protection of consumer privacy in advanced metering infrastructure supporting fine-grained data analysis (Q314810) (← links)
- Optimal constructions for active diagnosis (Q314815) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Soft computing methods for WiMAX network planning on 3D geographical information systems (Q314822) (← links)
- Converging to the chase -- a tool for finite controllability (Q314825) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- A lower bound for metric 1-median selection (Q340556) (← links)
