| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 21
reviews
|
|
|
 |
|
|
|
|
DeepGauge: multi-granularity testing criteria for deep learning systems
Ma L., Juefei-Xu F., Zhang F., Sun J., Xue M., Li B., Chen C., Su T., Li L., Liu Y., Zhao J., Wang Y. ASE 2018 (Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, Montpellier, France, Sep 3-7, 2018) 120-131, 2018. Type: Proceedings
Deep learning systems, driven by the success of deep neural networks (DNNs), are used in a wide variety of application areas, including safety-critical areas such as medical diagnostics and autonomous vehicles. However, DNN testing lag...
|
Oct 30 2019 |
|
|
|
|
|
|
Self-stabilizing repeated balls-into-bins
Becchetti L., Clementi A., Natale E., Pasquale F., Posta G. Distributed Computing 32(1): 59-68, 2019. Type: Article
Starting with an arbitrary assignment of n balls to n bins, the balls-into-bins process repeatedly selects one ball from a non-empty bin and reassigns the selected ball to one of the n
|
May 9 2019 |
|
|
|
|
|
|
Locating maximal approximate runs in a string
Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017. Type: Article
Repetition and periodicity play an essential role in efficient pattern matching, data analysis, and data compression. This paper presents an efficient algorithm to identify maximal sequences of approximate repetitions within a string, ...
|
Jul 3 2018 |
|
|
|
|
|
|
The g-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
Li D., Lu M. Theoretical Computer Science 674(C): 53-59, 2017. Type: Article
A network of processors is said to be diagnosable if its faulty nodes can be reliably identified. Identification of a faulty node depends on it having nonfaulty neighbors. The requirement that each fault-free node in a network should h...
|
Aug 7 2017 |
|
|
|
|
|
|
Edge-independent spanning trees in augmented cubes
Wang Y., Shen H., Fan J. Theoretical Computer Science 67023-32, 2017. Type: Article
The efficient construction of edge-independent spanning trees (EISTs) is interesting in itself, but also has important applications in network communications, for example, protocol design, secure communication, and fault-tolerant commu...
|
Jun 6 2017 |
|
|
|
|
|
|
Explaining mixture models through semantic pattern mining and banded matrix visualization
Adhikari P., Vavpetić A., Kralj J., Lavrać N., Hollmén J. Machine Learning 105(1): 3-39, 2016. Type: Article
Data analysis is concerned with making data comprehensible and amenable to interpretation by domain specialists. The central contribution of this paper is a three-part approach to data analysis....
|
Jan 3 2017 |
|
|
|
|
|
|
Probabilistic logic programming for hybrid relational domains
Nitti D., De Laet T., De Raedt L. Machine Learning 103(3): 407-449, 2016. Type: Article
Tracking objects and estimating objects’ sizes from their interactions are challenging state estimation problems in artificial intelligence and robotics. Robotics applications, with their physical needs, demand algorithms tha...
|
Jul 29 2016 |
|
|
|
|
|
|
Efficient distributed computation of distance sketches in networks
Das Sarma A., Dinitz M., Pandurangan G. Distributed Computing 28(5): 309-320, 2015. Type: Article
Shortest path computation is fundamental not only to efficient node-to-node communications, but also to search, discovery of relatedness between uniform resource locators (URLs) or between members of social networks, discovery of netwo...
|
May 11 2016 |
|
|
|
|
|
|
Controlling loosely cooperating processes
Muscholl A., Schewe S. Theoretical Computer Science 611(C): 136-141, 2016. Type: Article
Modern computing is heavily dependent on systems of loosely cooperating processes, whose knowledge of each other is limited to what can be inferred from local history of joint action....
|
Apr 27 2016 |
|
|
|
|
|
|
A multi-domain incremental analysis engine and its application to incremental resource analysis
Albert E., Correas J., Puebla G., Román-Díez G. Theoretical Computer Science 585(C): 91-114, 2015. Type: Article
Incremental analysis means making efficient use of the results of analyzing an original program when a modified program is analyzed. This is likely to be of interest to anyone concerned with modifying software while preserving or impro...
|
Sep 17 2015 |
|
|
|
|
|
| |
|
|
| |
|
|
