Sciweavers

229 search results - page 40 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
VTC
2006
IEEE
114views Communications» more  VTC 2006»
15 years 4 months ago
Channel Capacity of BLAST based on the Zero-Forcing criterion
In this paper, we present an asymptotical analysis of channel capacity of Bell labs layered space-time (BLAST) architectures based on a zero-forcing (ZF) criterion in the sense of...
Heunchul Lee, Inkyu Lee
FOSSACS
2005
Springer
15 years 3 months ago
Fault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
IPSN
2005
Springer
15 years 3 months ago
Lossy network correlated data gathering with high-resolution coding
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
Razvan Cristescu, Baltasar Beferull-Lozano
CIKM
2006
Springer
15 years 1 months ago
Privacy preserving sequential pattern mining in distributed databases
Research in the areas of privacy preserving techniques in databases and subsequently in privacy enhancement technologies have witnessed an explosive growth-spurt in recent years. ...
Vishal Kapoor, Pascal Poncelet, François Tr...
ICML
2010
IEEE
14 years 11 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic