CORR
2010
Springer
13 years 9 months ago
2010
Springer
Natural networks such as those between humans observed through their interactions or biological networks predicted based on various experimental measurements contain a wealth of i...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A large class of unsupervised algorithms for Word Sense Disambiguation (WSD) is that of dictionary-based methods. Various algorithms have as the root Lesk's algorith...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present parallel and sequential dense QR factorization algorithms that are optimized to avoid communication. Some of these are novel, and some extend earlier work. Communicatio...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...