Sciweavers

420 search results - page 14 / 84
» Discovering Conditional Functional Dependencies
Sort
View
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 10 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
RECOSOC
2007
160views Hardware» more  RECOSOC 2007»
13 years 11 months ago
Stack processor architecture and development methods suitable for dependable applications
Nowadays, reconfigurable and multiprocessor systems are becoming increasingly attractive for many applications. Such systems should be more and more dependable especially if error...
Mehdi Jallouli, Camille Diou, Fabrice Monteiro
ICML
2007
IEEE
14 years 10 months ago
On learning with dissimilarity functions
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...
Liwei Wang, Cheng Yang, Jufu Feng
ICASSP
2011
IEEE
13 years 1 months ago
Compressed learning of high-dimensional sparse functions
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...
Karin Schnass, Jan Vybíral
CSL
2010
Springer
13 years 10 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
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...
Christian Sternagel, René Thiemann