Sciweavers

1809 search results - page 236 / 362
» Weakly Computable Real Numbers
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
TOG
2008
122views more  TOG 2008»
13 years 10 months ago
Time-resolved 3d capture of non-stationary gas flows
Fluid simulation is one of the most active research areas in computer graphics. However, it remains difficult to obtain measurements of real fluid flows for validation of the simu...
Bradley Atcheson, Ivo Ihrke, Wolfgang Heidrich, Ar...
JMLR
2010
119views more  JMLR 2010»
13 years 5 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
JUCS
2010
109views more  JUCS 2010»
13 years 5 months ago
Semantics of Query-Driven Communication of Exact Values
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
Michal Konecný, Amin Farjudian
MM
2009
ACM
160views Multimedia» more  MM 2009»
14 years 4 months ago
On statistical multiplexing of variable-bit-rate video streams in mobile systems
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...
Cheng-Hsin Hsu, Mohamed Hefeeda