Sciweavers

16404 search results - page 290 / 3281
» A set coverage problem
Sort
View
127
Voted
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
16 years 5 months ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
152
Voted
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 5 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 11 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld
ICC
2008
IEEE
112views Communications» more  ICC 2008»
15 years 11 months ago
Achieving Fair TCP Access in the IEEE 802.11 Infrastructure Basic Service Set
—We illustrate the transport layer unfairness problem in the IEEE 802.11 Wireless Local Area Networks (WLANs). We design a link layer access control block for the Access Point (A...
Feyza Keceli, Inanc Inan, Ender Ayanoglu
150
Voted
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
15 years 11 months ago
Improvement of the embedding efficiency of LSB matching by sum and difference covering set
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
Xiaolong Li, Tieyong Zeng, Bin Yang