Sciweavers

2905 search results - page 349 / 581
» Formal Memetic Algorithms
Sort
View
FOCM
2011
96views more  FOCM 2011»
14 years 7 months ago
Persistent Intersection Homology
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
Paul Bendich, John Harer
SIAMCOMP
2011
14 years 6 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
ASUNAM
2011
IEEE
14 years 3 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
ICDCSW
2011
IEEE
14 years 3 months ago
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
Ville Satopaa, Jeannie R. Albrecht, David Irwin, B...
POPL
2012
ACM
13 years 11 months ago
Access permission contracts for scripting languages
The ideal software contract fully specifies the behavior of an operation. Often, in particular in the context of scripting languages, a full specification may be cumbersome to s...
Phillip Heidegger, Annette Bieniusa, Peter Thieman...