Sciweavers

939 search results - page 87 / 188
» A Case for Polyscopic Structuring of Information
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 10 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ICML
2010
IEEE
13 years 10 months ago
Active Learning for Networked Data
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
Mustafa Bilgic, Lilyana Mihalkova, Lise Getoor
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 9 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
IM
2006
13 years 9 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
CASES
2010
ACM
13 years 7 months ago
Improving the quality of ring oscillator PUFs on FPGAs
Physical Unclonable Functions (PUFs) based on Ring Oscillators (ROs) are a promising primitive for FPGA security. However, the quality of their implementation depends on several d...
Dominik Merli, Frederic Stumpf, Claudia Eckert