Sciweavers

9842 search results - page 413 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
124
Voted
PDPTA
2000
15 years 6 months ago
Impact of Using Pattern-Based Systems on the Qualities of Parallel Applications
Abstract Design patterns are micro architectures, high-level building blocks which describe the solutions to speci c problems in software design. These solutions have generally bee...
Ladan Tahvildari, Ajit Singh
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 4 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 4 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
140
Voted
ENTCS
2007
119views more  ENTCS 2007»
15 years 4 months ago
PML: Toward a High-Level Formal Language for Biological Systems
Documentation of knowledge about biological pathways is often informal and vague, making it difficult to efficiently synthesize the work of others into a holistic understanding of...
Bor-Yuh Evan Chang, Manu Sridharan
TCS
2008
15 years 4 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer