Sciweavers

8431 search results - page 44 / 1687
» Algorithmically Independent Sequences
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 4 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin
ICEIS
2003
IEEE
15 years 3 months ago
Data Position and Profiling in Domain-Independent Warehouse Cleaning
: A major problem that arises from integrating different databases is the existence of duplicates. Data cleaning is the process for identifying two or more records within the datab...
Christie I. Ezeife, Ajumobi Udechukwu
RTCSA
1999
IEEE
15 years 2 months ago
Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
Pascal Chevochot, Isabelle Puaut
JMLR
2002
160views more  JMLR 2002»
14 years 9 months ago
Kernel Independent Component Analysis
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
Francis R. Bach, Michael I. Jordan
ICA
2007
Springer
15 years 3 months ago
Robust Independent Component Analysis Using Quadratic Negentropy
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
Jaehyung Lee, Taesu Kim, Soo-Young Lee