Sciweavers

2104 search results - page 250 / 421
» Sorting with networks of data structures
Sort
View
ICANN
2007
Springer
16 years 9 days ago
A Topology-Independent Similarity Measure for High-Dimensional Feature Spaces
In the field of computer vision feature matching in high dimensional feature spaces is a commonly used technique for object recognition. One major problem is to find an adequate s...
Jochen Kerdels, Gabriele Peters
ECSQARU
1999
Springer
15 years 10 months ago
A Critique of Inductive Causation
: In this paper we consider the problem of inducing causal relations from statistical data. Although it is well known that a correlation does not justify the claim of a causal rela...
Christian Borgelt, Rudolf Kruse
200
Voted
COMPASS
1994
15 years 10 months ago
Equations for Describing Dynamic Nets of Communicating Systems
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
Manfred Broy
CONPAR
1992
15 years 10 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
195
Voted
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 8 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...