Sciweavers

1457 search results - page 142 / 292
» On the Uniform Distribution of Strings
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
15 years 6 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
SIAMDM
2010
114views more  SIAMDM 2010»
15 years 5 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat
FOCS
2009
IEEE
15 years 4 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
SIGSOFT
2003
ACM
16 years 7 months ago
Protecting C programs from attacks via invalid pointer dereferences
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
Suan Hsi Yong, Susan Horwitz
KDD
2001
ACM
142views Data Mining» more  KDD 2001»
16 years 7 months ago
TreeDT: gene mapping by tree disequilibrium test
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
Petteri Sevon, Hannu Toivonen, Vesa Ollikainen