Sciweavers

1971 search results - page 332 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 28 days ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
130
Voted
NIPS
2008
15 years 1 months ago
Adaptive Template Matching with Shift-Invariant Semi-NMF
How does one extract unknown but stereotypical events that are linearly superimposed within a signal with variable latencies and variable amplitudes? One could think of using temp...
Jonathan Le Roux, Alain de Cheveigné, Lucas...
RT
1998
Springer
15 years 4 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
CLUSTER
2004
IEEE
15 years 4 months ago
A client-centric grid knowledgebase
Grid computing brings with it additional complexities and unexpected failures. Just keeping track of our jobs traversing different grid resources before completion can at times be...
George Kola, Tevfik Kosar, Miron Livny
ISVD
2010
IEEE
14 years 11 months ago
Alpha Shape Topology of the Cosmic Web
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
Rien van de Weygaert, Erwin Platen, Gert Vegter, B...