Sciweavers

406 search results - page 56 / 82
» Recursive Approximability of Real Numbers
Sort
View
TGC
2007
Springer
16 years 1 days ago
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
Luigi Liquori, Michel Cosnard
CIE
2010
Springer
15 years 9 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
DKE
2008
79views more  DKE 2008»
15 years 6 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
ICPR
2006
IEEE
16 years 7 months ago
An integrated Monte Carlo data association framework for multi-object tracking
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
GLOBECOM
2009
IEEE
16 years 20 days ago
On the Performance Gains of VoIP Aggregation and ROHC over a WirelessMAN-OFDMA Air Interface
—A growing number of mobile WiMAX deployments are in progress world-wide and the technology is anticipated to play a key role in next generation mobile broadband wireless network...
Jarno Pinola, Esa Piri, Kostas Pentikousis