Sciweavers

2969 search results - page 449 / 594
» A space efficient algorithm for group structure computation
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 6 months 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
WOTUG
2008
15 years 7 months ago
Process-Oriented Collective Operations
Abstract. Distributing process-oriented programs across a cluster of machines requires careful attention to the effects of network latency. The MPI standard, widely used for cluste...
John Markus Bjørndalen, Adam T. Sampson
CGA
2006
15 years 6 months ago
The Distance-Similarity Metaphor in Region-Display Spatializations
n explore and understand abstract information spaces as if they were real geographic spaces. According to the distance-similarity metaphor1 one of the most popular spatial metaphor...
Sara Irina Fabrikant, Daniel R. Montello, David M....
ECCV
2008
Springer
16 years 8 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher
RECOMB
2004
Springer
16 years 6 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett