Sciweavers

535 search results - page 43 / 107
» Online learning over graphs
Sort
View
CIKM
2010
Springer
13 years 6 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...
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
14 years 1 months ago
Price prediction and insurance for online auctions
Online auctions are generating a new class of fine-grained data about online transactions. This data lends itself to a variety of applications and services that can be provided to...
Rayid Ghani
IPSN
2010
Springer
14 years 2 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
CVPR
2012
IEEE
11 years 10 months ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
AAAI
2010
13 years 9 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos