4451 search results - page 323 / 891 » On Random Ordering Constraints |
151
click to vote
ICA
2007
Springer
16 years 26 days ago
2007
Springer
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean “Exclusive Or” (XOR) operation. Thus, each mixtur...
160
click to vote
ICALP
2005
Springer
16 years 7 days ago
2005
Springer
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
179
click to vote
IPSN
2005
Springer
16 years 7 days ago
2005
Springer
Abstract— In this paper we present a novel sequence-based RF localization algorithm called Ecolocation. Our algorithm determines the location of unknown nodes by examining the or...
162
click to vote
NAA
2000
Springer
15 years 10 months ago
2000
Springer
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
167
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...