Sciweavers

3356 search results - page 183 / 672
» Determining Consensus Numbers
Sort
View
159
Voted
FSTTCS
2010
Springer
15 years 4 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
GI
2009
Springer
15 years 3 months ago
Tracking of Extended Objects and Group Targets using Random Matrices - A Performance Analysis
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
Michael Feldmann, Dietrich Fraenken
COMPUTING
2010
15 years 3 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
AMC
2011
15 years 1 months ago
Variational theory and domain decomposition for nonlocal problems
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establi...
Burak Aksoylu, Michael L. Parks
JCT
2011
66views more  JCT 2011»
15 years 1 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...