Sciweavers

4894 search results - page 862 / 979
» Dynamic Abstraction Planning
Sort
View
BIOCOMP
2006
14 years 11 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
CDES
2006
240views Hardware» more  CDES 2006»
14 years 11 months ago
Design of Low Power 4-Tap 8-Bit Adiabatic FIR Filter
Abstract-- Digital signal processing (DSP) is used to perform filtering, decimation and down conversion in common communications systems, like in oversampling analog to digital con...
Arun N. Chandorkar, Gurvinder Singh
DAIS
2006
14 years 11 months ago
Towards Context-Aware Transaction Services
Abstract. For years, transactional protocols have been defined for particular application needs. Traditionally, when implementing a transaction service, a protocol is chosen and re...
Romain Rouvoy, Patricia Serrano-Alvarado, Philippe...
98
Voted
FIMI
2004
161views Data Mining» more  FIMI 2004»
14 years 11 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
FMOODS
2006
14 years 11 months ago
Mobility Mechanisms in Service Oriented Computing
Abstract. The usual context of service oriented computing is characterized by several services offering the same functionalities, new services that are continuosly deployed and oth...
Claudio Guidi, Roberto Lucchi