Sciweavers

4560 search results - page 65 / 912
» Finding Data in the Neighborhood
Sort
View
AIPR
2000
IEEE
14 years 9 days ago
Gradient-Oriented Profiles for Unsupervised Boundary Classification
We present a method for unsupervised boundary classijication by producing and analyzing intensity profiles. Each profile is created by sampling an ellipsoidal neighborhood of voxe...
Robert J. Tamburo, George D. Stetten
SIGGRAPH
2000
ACM
14 years 7 days ago
Patching Catmull-Clark meshes
Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision...
Jörg Peters
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 2 months ago
Large-Scale Collective Entity Matching
There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being app...
Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofala...
CN
2008
108views more  CN 2008»
13 years 8 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
IMCSIT
2010
13 years 5 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen