Sciweavers

8431 search results - page 52 / 1687
» Algorithmically Independent Sequences
Sort
View
PODC
2005
ACM
15 years 3 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
ICTAI
2006
IEEE
15 years 3 months ago
Sequence Mining Without Sequences: A New Way for Privacy Preserving
During the last decade, sequential pattern mining has been the core of numerous researches. It is now possible to efficiently discover users’ behavior in various domains such a...
Stéphanie Jacquemont, François Jacqu...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 3 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
FUZZIEEE
2007
IEEE
15 years 4 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
ICANN
2010
Springer
14 years 10 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...