Sciweavers

16404 search results - page 2878 / 3281
» A set coverage problem
Sort
View
IUI
2011
ACM
14 years 9 months ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...
PERCOM
2011
ACM
14 years 9 months ago
A robust dead-reckoning pedestrian tracking system with low cost sensors
—The emergence of personal mobile device with low cost sensors, such as accelerometer and digital compass, has made dead-reckoning (DR) an attractive choice for indoor pedestrian...
Yunye Jin, Hong-Song Toh, Wee-Seng Soh, Wai-Choong...
PLDI
2011
ACM
14 years 9 months ago
Automatic CPU-GPU communication management and optimization
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
Thomas B. Jablin, Prakash Prabhu, James A. Jablin,...
PRL
2011
14 years 9 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
« Prev « First page 2878 / 3281 Last » Next »