Sciweavers

3875 search results - page 627 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 9 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 12 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
CBMS
2006
IEEE
15 years 11 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
ESWS
2010
Springer
15 years 10 months ago
Leveraging Terminological Structure for Object Reconciliation
Abstract. It has been argued that linked open data is the major benefit of semantic technologies for the web as it provides a huge amount of structured data that can be accessed i...
Jan Noessner, Mathias Niepert, Christian Meilicke,...
AAAI
2010
15 years 7 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos