Sciweavers

1390 search results - page 259 / 278
» Computing the depth of a flat
Sort
View
86
Voted
CVPR
2008
IEEE
15 years 4 months ago
Retinal image registration from 2D to 3D
We propose a 2D registration method for multi-modal image sequences of the retinal fundus, and a 3D metric reconstruction of near planar surface from multiple views. There are two...
Yuping Lin, Gérard G. Medioni
ANCS
2006
ACM
15 years 3 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
SPAA
2005
ACM
15 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
SAC
2004
ACM
15 years 3 months ago
Dynamic on-demand updating of data in real-time database systems
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...
Thomas Gustafsson, Jörgen Hansson
COMPGEOM
2003
ACM
15 years 2 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson