Sciweavers

2354 search results - page 439 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ICA
2004
Springer
14 years 1 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 1 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SIGGRAPH
1994
ACM
13 years 11 months ago
Frameless rendering: double buffering considered harmful
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
Gary Bishop, Henry Fuchs, Leonard McMillan, Ellen ...
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 11 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 9 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...