Sciweavers

15351 search results - page 2933 / 3071
» The information bottleneck method
Sort
View
MOBISYS
2008
ACM
14 years 10 months ago
Peopletones: a system for the detection and notification of buddy proximity on mobile phones
Mobile phones have the potential to be useful agents for their owners by detecting and reporting situations that are of interest. Several challenges emerge in the case of detectin...
Kevin A. Li, Timothy Sohn, Steven Huang, William G...
DCC
2008
IEEE
14 years 10 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 7 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 7 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
EUROSYS
2009
ACM
14 years 7 months ago
Pointless tainting?: evaluating the practicality of pointer tainting
This paper evaluates pointer tainting, an incarnation of Dynamic Information Flow Tracking (DIFT), which has recently become an important technique in system security. Pointer tai...
Asia Slowinska, Herbert Bos
« Prev « First page 2933 / 3071 Last » Next »