Sciweavers

4451 search results - page 751 / 891
» On Random Ordering Constraints
Sort
View
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
14 years 1 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
14 years 1 months ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...
CIKM
2006
Springer
14 years 1 months ago
Constrained subspace skyline computation
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
Evangelos Dellis, Akrivi Vlachou, Ilya Vladimirski...
DAGM
2006
Springer
14 years 1 months ago
Diffusion-Like Reconstruction Schemes from Linear Data Models
In this paper we extend anisotropic diffusion with a diffusion tensor to be applicable to data that is well modeled by linear models. We focus on its variational theory, and invest...
Hanno Scharr
DICS
2006
14 years 1 months ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...