Sciweavers

381 search results - page 21 / 77
» Fast Neighbor Joining
Sort
View
BNCOD
2004
397views Database» more  BNCOD 2004»
14 years 11 months ago
DbSurfer: A Search and Navigation Tool for Relational Databases
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
Richard Wheeldon, Mark Levene, Kevin Keenoy
P2P
2006
IEEE
148views Communications» more  P2P 2006»
15 years 4 months ago
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
Thomas Locher, Stefan Schmid, Roger Wattenhofer
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
15 years 11 months ago
Supporting Streaming Updates in an Active Data Warehouse
Active Data Warehousing has emerged as an alternative to conventional warehousing practices in order to meet the high demand of applications for up-to-date information. In a nutsh...
Neoklis Polyzotis, Spiros Skiadopoulos, Panos Vass...

Publication
3460views
16 years 11 months ago
Multistencils Fast Marching Methods: A Highly Accurate Solution to the Eikonal Equation on Cartesian Domains
A wide range of computer vision applications require an accurate solution of a particular Hamilton-Jacobi (HJ) equation known as the Eikonal equation. In this paper, we propose an ...
M. Sabry Hassouna, Aly A. Farag
CVPR
2012
IEEE
13 years 11 days ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...