Sciweavers

190 search results - page 32 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
HAIS
2011
Springer
12 years 11 months ago
Clustering Ensemble for Spam Filtering
One of the main problems that modern e-mail systems face is the management of the high degree of spam or junk mail they recieve. Those systems are expected to be able to distinguis...
Santiago Porras, Bruno Baruque, Belén Vaque...
EVOW
2007
Springer
13 years 11 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
SIGCOMM
2009
ACM
14 years 2 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
TELETRAFFIC
2007
Springer
14 years 1 months ago
On the Interaction Between Internet Applications and TCP
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...