Sciweavers

1941 search results - page 239 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SPAA
2003
ACM
15 years 11 months ago
Nonblocking k-compare-single-swap
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
Victor Luchangco, Mark Moir, Nir Shavit
CSEE
2003
Springer
15 years 11 months ago
The Cross-Course Software Engineering Project at the NTNU: Four Years of Experience
Many software engineering courses include all-term projects to convey principles relating to large-scale multi-person development. But even such projects will easily be too small ...
Guttorm Sindre, Tor Stålhane, Gunnar Brataas...
ILP
2003
Springer
15 years 11 months ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer
AINA
2010
IEEE
15 years 11 months ago
A Quadratic, Complete, and Minimal Consistency Diagnosis Process for Firewall ACLs
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
ECCV
2010
Springer
15 years 11 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...