3363 search results - page 525 / 673 » A Framework for Knowledge Reuse |
149
Voted
MM
2005
ACM
15 years 9 months ago
2005
ACM
We develop a framework for the automatic discovery of query classes for query-class-dependent search models in multimodal retrieval. The framework automatically discovers useful q...
141
click to vote
VIZSEC
2004
Springer
15 years 9 months ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
147
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
121
Voted
PODC
1999
ACM
15 years 8 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
155
click to vote
KDD
1999
ACM
15 years 8 months ago
1999
ACM
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...