Sciweavers

2016 search results - page 211 / 404
» Megamaps: Construction and Examples
Sort
View
MICCAI
2002
Springer
16 years 7 months ago
Brownian Warps: A Least Committed Prior for Non-rigid Registration
Non-rigid registration requires a smoothness or regularization term for making the warp field regular. Standard models in use here include b-splines and thin plate splines. In thi...
Mads Nielsen, Peter Johansen, Andrew D. Jackson, B...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
DCC
2008
IEEE
16 years 6 months ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel
DCC
2004
IEEE
16 years 6 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
IEEEARES
2009
IEEE
16 years 1 months ago
Identity-Based Hybrid Signcryption
—Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than th...
Fagen Li, Masaaki Shirase, Tsuyoshi Takagi