Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Ladan, Tahvildari"'
Publikováno v:
Technology Innovation Management Review, Iss August 2013: Cybersecurity, Pp 59-64 (2013)
Security is a critical concern in today's software systems. Besides the interconnectivity and dynamic nature of network systems, the increasing complexity in modern software systems amplifies the complexity of IT security. This fact leaves attackers
Externí odkaz:
https://doaj.org/article/07e87e75b8234200ae2fec82d78941fd
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 42:1729-1740
Nearest neighbor search is a basic and recurring proximity problem that has been studied for several decades. The goal is to preprocess a dataset of points so that we can quickly report the closet point(s) to any query point. Many recent applications
Autor:
Sepehr Eghbali, Ladan Tahvildari
Publikováno v:
IEEE Transactions on Software Engineering. 42:1178-1195
Test case prioritization aims at ordering test cases to increase the rate of fault detection , which quantifies how fast faults are detected during the testing phase. A common approach for test case prioritization is to use the information of previou
Autor:
Sepehr Eghbali, Ladan Tahvildari
Publikováno v:
CVPR
Hashing methods, which encode high-dimensional images with compact discrete codes, have been widely applied to enhance large-scale image retrieval. In this paper, we put forward Deep Spherical Quantization (DSQ), a novel method to make deep convoluti
Publikováno v:
ICSE (Companion Volume)
Test case prioritization reorders sequences of test cases with the aim of increasing the rate at which faults can be detected. Most existing prioritization techniques employ coverage information gathered on previous test case executions to rank test
Publikováno v:
Science of Computer Programming. 95:44-72
This paper proposes a novel approach for discovering cultural scenes in social network data. "Cultural scenes" are aggregations of people with overlapping interests, whose loosely interacting activities from virtuous cycles amplify cultural output (e
Publikováno v:
ICDM
We revisit the K Nearest Neighbors (KNN) problem in large binary datasets which is of major importance in several applied areas. The goal is to find the K nearest items in a dataset to a query point where both the query and the items lie in the Hammi
Publikováno v:
Technology Innovation Management Review, Iss August 2013: Cybersecurity, Pp 59-64 (2013)
Cybersecurity threats, such as Internet worms (tinyurl.com/lg2wghw), can spread too quickly for humans to respond and pose a genuine risk to users and systems. In March 2013, a computer scam fooled some Canadian Internet users by picking up their loc
Publikováno v:
Journal of Systems and Software. 85:2720-2737
In this article, we present a generic model-centric approach for realizing fine-grained dynamic adaptation in software systems by managing and interpreting graph-based models of software at runtime. We implemented this approach as the Graph-based Run
Autor:
Mohammad Hamdaqa, Ladan Tahvildari
Publikováno v:
MESOCA
Several planning and performance analysis tools and techniques are available to execute sophisticated "what-if" analysis, in order to dynamically reconfigure cloud applications, modify them, and update their adaptation policies. However, in order to