415 search results - page 18 / 83 » Propagating functional dependencies with conditions |
96
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
CSL
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
66
Voted
DAC
1994
ACM
15 years 1 months ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
LACL
2005
Springer
15 years 3 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...