Sciweavers

7289 search results - page 67 / 1458
» A Dependent Set Theory
Sort
View
INFSOF
2008
85views more  INFSOF 2008»
13 years 7 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
NECO
2010
97views more  NECO 2010»
13 years 6 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
VISSYM
2004
13 years 9 months ago
TimeHistograms for Large, Time-Dependent Data
Histograms are a very useful tool for data analysis, because they show the distribution of values over a data dimension. Many data sets in engineering (like computational fluid dy...
Robert Kosara, Fabian Bendix, Helwig Hauser
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
14 years 8 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
DAI
1995
Springer
13 years 11 months ago
A Formal View of Social Dependence Networks
In response to the problems that have arisen regarding the terminology and concepts of agent-oriented systems, previous work has described a formal framework for understanding agen...
Mark d'Inverno, Michael Luck