Sciweavers

WWW
2011
ACM
13 years 5 months ago
Pragmatic evaluation of folksonomies
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...
Denis Helic, Markus Strohmaier, Christoph Trattner...
WWW
2011
ACM
13 years 5 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
TVCG
2011
274views more  TVCG 2011»
13 years 5 months ago
Memory-Scalable GPU Spatial Hierarchy Construction
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
TOMS
2011
101views more  TOMS 2011»
13 years 5 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
TKDE
2011
479views more  TKDE 2011»
13 years 5 months ago
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction
—Discriminant feature extraction plays a central role in pattern recognition and classification. Linear Discriminant Analysis (LDA) is a traditional algorithm for supervised feat...
Wei Zhang, Zhouchen Lin, Xiaoou Tang
TIT
2011
193views more  TIT 2011»
13 years 5 months ago
Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
—Maximization of the weighted sum-rate of secondary users (SUs) possibly equipped with multiantenna transmitters and receivers is considered in the context of cognitive radio (CR...
Seung-Jun Kim, Georgios B. Giannakis
TCS
2011
13 years 5 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
TAPAS
2011
243views Algorithms» more  TAPAS 2011»
13 years 5 months ago
Speed Scaling for Energy and Performance with Instantaneous Parallelism
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
Hongyang Sun, Yuxiong He, Wen-Jing Hsu
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
13 years 5 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...