Sciweavers

1096 search results - page 203 / 220
» Computation Slicing: Techniques and Theory
Sort
View
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
COMPGEOM
2010
ACM
14 years 27 days ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ALT
1995
Springer
14 years 17 days ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
CIMAGING
2008
165views Hardware» more  CIMAGING 2008»
13 years 10 months ago
Multimodal unbiased image matching via mutual information
In the past decade, information theory has been studied extensively in computational imaging. In particular, image matching by maximizing mutual information has been shown to yiel...
Igor Yanovsky, Paul M. Thompson, Stanley Osher, Al...
NIPS
2008
13 years 10 months ago
Natural Image Denoising with Convolutional Networks
We present an approach to low-level vision that combines two main ideas: the use of convolutional networks as an image processing architecture and an unsupervised learning procedu...
Viren Jain, H. Sebastian Seung