Sciweavers

4850 search results - page 782 / 970
» Approximate Data Structures with Applications
Sort
View
ICWS
2009
IEEE
15 years 2 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
149
Voted
COMSIS
2010
15 years 2 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...
CVPR
2011
IEEE
15 years 4 days ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
CORR
2012
Springer
167views Education» more  CORR 2012»
14 years 13 days ago
Multidimensional counting grids: Inferring word order from disordered bags of words
Models of bags of words typically assume topic mixing so that the words in a single bag come from a limited number of topics. We show here that many sets of bag of words exhibit a...
Nebojsa Jojic, Alessandro Perina
WWW
2008
ACM
16 years 5 months ago
User oriented link function classification
Currently most link-related applications treat all links in the same web page to be identical. One link-related application usually requires one certain property of hyperlinks but...
Mingliang Zhu, Weiming Hu, Ou Wu, Xi Li, Xiaoqin Z...