Sciweavers

919 search results - page 47 / 184
» Efficient computation of view subsets
Sort
View
VIZSEC
2004
Springer
14 years 2 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
BMCBI
2005
151views more  BMCBI 2005»
13 years 8 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 5 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...
EOR
2006
120views more  EOR 2006»
13 years 8 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 9 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar