Sciweavers

557 search results - page 96 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
BIRTHDAY
2011
Springer
13 years 11 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 4 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 1 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 4 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
VISUALIZATION
1999
IEEE
15 years 3 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis