Sciweavers

274 search results - page 36 / 55
» The Information Bottleneck EM Algorithm
Sort
View
PERCOM
2011
ACM
12 years 11 months ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 8 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
CF
2009
ACM
14 years 2 months ago
Quantitative analysis of sequence alignment applications on multiprocessor architectures
The exponential growth of databases that contains biological information (such as protein and DNA data) demands great efforts to improve the performance of computational platforms...
Friman Sánchez, Alex Ramírez, Mateo ...
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 19 days ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
DAMON
2008
Springer
13 years 9 months ago
Critical sections: re-emerging scalability concerns for database storage engines
Critical sections in database storage engines impact performance and scalability more as the number of hardware contexts per chip continues to grow exponentially. With enough thre...
Ryan Johnson, Ippokratis Pandis, Anastasia Ailamak...