Sciweavers

14518 search results - page 243 / 2904
» Two Problems for Sophistication
Sort
View
TWC
2008
158views more  TWC 2008»
15 years 21 days ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
82
Voted
ALGORITHMICA
2000
65views more  ALGORITHMICA 2000»
15 years 19 days ago
A Simultaneous Search Problem
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
Ee-Chien Chang, Chee-Keng Yap
MOC
1998
96views more  MOC 1998»
15 years 14 days ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche
89
Voted
RC
2007
64views more  RC 2007»
15 years 9 days ago
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
Daniel Berleant, Olga Kosheleva, Vladik Kreinovich...
96
Voted
NECO
2010
97views more  NECO 2010»
14 years 11 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell