Sciweavers

746 search results - page 94 / 150
» Fast (Structured) Newton Computations
Sort
View
ICDAR
2009
IEEE
15 years 3 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
332
Voted
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 8 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
ICNP
2009
IEEE
16 years 7 days ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 5 months ago
An adaptive embedded architecture for real-time Particle Image Velocimetry algorithms
Particle Image Velocimetry (PIV) is a method of imaging and analysing fields of flows. The PIV techniques compute and display all the motion vectors of the field in a resulting im...
Alain Aubert, Nathalie Bochard, Virginie Fresse
ICPR
2004
IEEE
16 years 6 months ago
Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...
Georg Langs, Petia Radeva, David Rotger, Francesc ...