Sciweavers

3328 search results - page 433 / 666
» On Plateaued Functions and Their Constructions
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 6 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ISOLA
2010
Springer
15 years 5 months ago
Ten Years of Performance Evaluation for Concurrent Systems Using CADP
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
Nicolas Coste, Hubert Garavel, Holger Hermanns, Fr...
SAC
2010
ACM
15 years 5 months ago
Optimal linear projections for enhancing desired data statistics
Problems involving high-dimensional data, such as pattern recognition, image analysis, and gene clustering, often require a preliminary step of dimension reduction before or durin...
Evgenia Rubinshtein, Anuj Srivastava
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICWE
2009
Springer
15 years 4 months ago
A Component-Based Approach for Engineering Enterprise Mashups
Mashup applications combine pieces of functionality from several existing, heterogeneous sources to provide new integrated functionality. This paper presents the design of an enter...
Javier López, Fernando Bellas, Alberto Pan,...