Sciweavers

4343 search results - page 15 / 869
» Segmentation from a Box
Sort
View
ICML
2004
IEEE
14 years 9 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
ISSRE
2000
IEEE
14 years 1 months ago
Software Black Box: An Alternative Mechanism for Failure Analysis
Learning from software failures is an essential step towards the development of more reliable software systems and processes. However, as more intricate software systems are devel...
Sebastian G. Elbaum, John C. Munson
SOSP
2003
ACM
14 years 5 months ago
Performance debugging for distributed systems of black boxes
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
Marcos Kawazoe Aguilera, Jeffrey C. Mogul, Janet L...
CORR
2009
Springer
137views Education» more  CORR 2009»
13 years 6 months ago
Choreographies with Secure Boxes and Compromised Principals
We equip choreography-level session descriptions with a simple abstraction of a security infrastructure. Message components may be enclosed within (possibly nested) "boxes&quo...
Marco Carbone, Joshua D. Guttman
EUROCRYPT
2007
Springer
14 years 2 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak