Sciweavers

809 search results - page 48 / 162
» Similarity, topology, and uniformity
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 6 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ECCV
2002
Springer
16 years 19 days ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 5 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
JSAC
2010
94views more  JSAC 2010»
14 years 9 months ago
LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System
During the last years several operators have expressed concerns about the continued growth of the BGP routing tables in the default-free zone. Proposed solutions for this issue ar...
Loránd Jakab, Albert Cabellos-Aparicio, Flo...
DAGSTUHL
2007
15 years 6 days ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis