Sciweavers

1813 search results - page 327 / 363
» Instance Pruning Techniques
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ML
2010
ACM
151views Machine Learning» more  ML 2010»
14 years 8 months ago
Inductive transfer for learning Bayesian networks
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales
CONEXT
2010
ACM
14 years 7 months ago
Optimal content placement for a large-scale VoD system
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...
ICCV
2009
IEEE
14 years 7 months ago
A hybrid generative/discriminative classification framework based on free-energy terms
Hybrid generative-discriminative techniques and, in particular, generative score-space classification methods have proven to be valuable approaches in tackling difficult object or...
Alessandro Perina, Marco Cristani, Umberto Castell...
IPPS
2010
IEEE
14 years 6 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik