Sciweavers

14518 search results - page 210 / 2904
» Two Problems for Sophistication
Sort
View
174
Voted
IPL
2007
130views more  IPL 2007»
15 years 3 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
ENTCS
2002
207views more  ENTCS 2002»
15 years 3 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
104
Voted
ADT
2010
15 years 1 months ago
Survey of NLOS identification and error mitigation problems in UWB-based positioning algorithms for dense environments
Abstract In this survey, the currently available ultrawideband-based non-line-of-sight (NLOS) identification and error mitigation methods are presented. They are classified into se...
Jasurbek Khodjaev, Yongwan Park, Aamir Saeed Malik
116
Voted
IDA
2009
Springer
15 years 1 months ago
A Cascade System for Solving Permutation and Gain Problems in Frequency-Domain BSS
Abstract. This paper presents a novel technique for separating convolutive mixtures of statistically independent non-Gaussian signals. The time-domain convolution is transformed in...
Daniel I. Iglesia, Héctor J. Pérez-I...
126
Voted
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 10 months ago
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
Jie Shen, Haijun Yu