Sciweavers

4541 search results - page 79 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICWS
2009
IEEE
14 years 9 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang
CVPR
2012
IEEE
13 years 1 months ago
Finite Element based sequential Bayesian Non-Rigid Structure from Motion
Navier’s equations modelling linear elastic solid deformations are embedded within an Extended Kalman Filter (EKF) to compute a sequential Bayesian estimate for the Non-Rigid St...
Antonio Agudo, Begoña Calvo, J. M. M. Monti...
DILS
2005
Springer
15 years 1 months ago
Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
Greeshma Neglur, Robert L. Grossman, Bing Liu
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
15 years 5 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
ICML
2007
IEEE
15 years 12 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen