Sciweavers

11740 search results - page 261 / 2348
» More Problems in Rewriting
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 23 days ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
DSS
2006
95views more  DSS 2006»
15 years 6 months ago
Information foraging on the web: The effects of "acceptable" Internet delays on multi-page information search behavior
Delays on the Web are a persistent and highly publicized problem. Long delays have been shown to reduce information search, but less is known about the impact of more modest
Alan R. Dennis, Nolan J. Taylor
PPSN
2004
Springer
15 years 12 months ago
Fitness Distributions and GA Hardness
Considerable research effort has been spent in trying to formulate a good definition of GA-Hardness. Given an instance of a problem, the objective is to estimate the performance of...
Yossi Borenstein, Riccardo Poli
AISC
2000
Springer
15 years 11 months ago
Reasoning about the Elementary Functions of Complex Analysis
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...