Advanced search
Showing result 1 - 5 of 11 essays matching the above criteria.
-
1. Thermal textile pixels : Out-of-plane and in-plane heat transfer measurements of knitted textiles
University essay from Högskolan i Borås/Akademin för textil, teknik och ekonomiAbstract : The human body possesses a highly developed range of senses that help orienting oneself in everyday life. Especially when it comes to navigating, perceiving and reacting to the world around us, people tend to rely mostly on their vision and hearing. READ MORE
-
2. Solving Temporal CSPs via Enumeration and SAT Compilation
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : The constraint satisfaction problem (CSP) is a powerful framework used in theoretical computer science for formulating a multitude of problems. The CSP over a constraint language Γ (CSP(Γ)) is the decision problem of verifying whether a set of constraints based on the relations in Γ admits a satisfying assignment or not. READ MORE
-
3. Pattern Detection in Bipartite Temporal Network
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Pattern detection in social networks has been of great interest recently because it helps to reveal insights about how people communicate. In graph mining, this is referred to as a frequent sub-graphs mining problem and it has many variations regarding the structure of the network - i.e. how much information the graph holds. READ MORE
-
4. Anomaly detection in user behavior of websites using Hierarchical Temporal Memories : Using Machine Learning to detect unusual behavior from users of a web service to quickly detect possible security hazards.
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : This Master's Thesis focuses on the recent Cortical Learn-ing Algorithm (CLA), designed for temporal anomaly detection. It is here applied to the problem of anomaly detec-tion in user behavior of web services, which is getting moreand more important in a network security context. READ MORE
-
5. An extension of the PPSZ Algorithm to Infinite-Domain Constraint Satisfaction Problems
University essay from Linköpings universitet/Programvara och systemAbstract : The PPSZ algorithm (Paturi et al., FOCS 1998) is the fastest known algorithm for solving k-SAT when k >= 4. Hertli et al. recently extended the algorithm to solve (d, k)-Clause Satisfaction problems ((d,k)-ClSP) for which it is the fastest known algorithm for all k >= 3 (Hertli et al. READ MORE
