Sciweavers

746 search results - page 50 / 150
» Fast (Structured) Newton Computations
Sort
View
CIKM
2010
Springer
13 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...
ICCV
2009
IEEE
13 years 8 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
SDM
2009
SIAM
162views Data Mining» more  SDM 2009»
14 years 7 months ago
Link Propagation: A Fast Semi-supervised Learning Algorithm for Link Prediction.
We propose Link Propagation as a new semi-supervised learning method for link prediction problems, where the task is to predict unknown parts of the network structure by using aux...
Hisashi Kashima, Tsuyoshi Kato, Yoshihiro Yamanish...
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
14 years 4 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
TPHOL
2000
IEEE
14 years 2 months ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin