Sciweavers

514 search results - page 13 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
DLT
2008
13 years 9 months ago
On the Size Complexity of Rotating and Sweeping Automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
Christos A. Kapoutsis, Richard Královic, To...
CSE
2009
IEEE
14 years 8 min ago
Clustering Signature in Complex Social Networks
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
Ueli Peter, Tomas Hruz
TIFS
2010
120views more  TIFS 2010»
13 years 3 months ago
Quantitative Structural Steganalysis of Jsteg
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
Jan Kodovský, Jessica J. Fridrich
JMLR
2002
90views more  JMLR 2002»
13 years 8 months ago
Machine Learning with Data Dependent Hypothesis Classes
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
Adam Cannon, J. Mark Ettinger, Don R. Hush, Clint ...
METRICS
2003
IEEE
14 years 1 months ago
An Analogy-Based Approach for Predicting Design Stability of Java Classes
Predicting stability in object-oriented (OO) software, i.e., the ease with which a software item evolves while preserving its design, is a key feature for software maintenance. In...
David Grosser, Houari A. Sahraoui, Petko Valtchev