Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

111

Voted

EDBT
2006
ACM

131views Database» more EDBT 2006»

Finding Data Broadness Via Generalized Nearest Neighbors

16 years 3 months ago

Finding Data Broadness Via Generalized Nearest Neighbors

Download www.cise.ufl.edu

Jayendra Venkateswaran, Orhan Çamoglu, Tame

Real-time Traffic

Database | EDBT 2006 | Nearest Neighbors |

claim paper

Related Content

» What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images

» Continuous obstructed nearest neighbor queries in spatial databases

» Iterated Nearest Neighbors and Finding Minimal Polytopes

» Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces

» Finding nearest neighbors in growthrestricted metrics

» KNearest Neighbor Finding Using MaxNearestDist

» Visible Reverse kNearest Neighbor Queries

» Nearest Neighbor Networks clustering expression data based on gene neighborhoods

» Processing inroute nearest neighbor queries a comparison of alternative approaches

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2006
Where	EDBT
Authors	Jayendra Venkateswaran, Orhan Çamoglu, Tamer Kahveci

Comments (0)