Sciweavers

460 search results - page 72 / 92
» Randomized Algorithms for Motif Detection
Sort
View
TAPSOFT
1995
Springer
14 years 4 days ago
Anatomy of the Pentium Bug
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
Vaughan R. Pratt
ICA
2004
Springer
14 years 2 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
CACM
2008
131views more  CACM 2008»
13 years 8 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
ICRA
2008
IEEE
229views Robotics» more  ICRA 2008»
14 years 3 months ago
Learning of moving cast shadows for dynamic environments
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
Ajay J. Joshi, Nikolaos Papanikolopoulos