Sciweavers

657 search results - page 127 / 132
» On the Identification of a Class of Linear Models
Sort
View
SIGCOMM
2012
ACM
13 years 3 days ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
15 years 10 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
CSFW
2009
IEEE
15 years 4 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
TAMC
2007
Springer
15 years 3 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...