Sciweavers

1089 search results - page 123 / 218
» Randomness and Reducibility
Sort
View
CVPR
2009
IEEE
15 years 5 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
PAKDD
2005
ACM
94views Data Mining» more  PAKDD 2005»
14 years 3 months ago
Progressive Sampling for Association Rules Based on Sampling Error Estimation
We explore in this paper a progressive sampling algorithm, called Sampling Error Estimation (SEE), which aims to identify an appropriate sample size for mining association rules. S...
Kun-Ta Chuang, Ming-Syan Chen, Wen-Chieh Yang
TC
2008
13 years 10 months ago
A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks
This paper presents a new coverage formulation addressing the quality of service of sensor networks that cooperatively detect targets traversing a region of interest. The problem o...
Kelli Baumgartner, Silvia Ferrari
CSE
2009
IEEE
14 years 5 months ago
Noise Injection for Search Privacy Protection
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
Shaozhi Ye, Shyhtsun Felix Wu, Raju Pandey, Hao Ch...
ICC
2007
IEEE
14 years 4 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen