Sciweavers

5138 search results - page 701 / 1028
» Low-Entropy Set Selection.
Sort
View
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 1 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
CSFW
2009
IEEE
16 years 1 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
INFOCOM
2008
IEEE
16 years 1 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
INFOCOM
2008
IEEE
16 years 1 months ago
Balanced Relay Allocation on Heterogeneous Unstructured Overlays
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
Hung Xuan Nguyen, Daniel R. Figueiredo, Matthias G...
APCSAC
2007
IEEE
16 years 1 months ago
Runtime Performance Projection Model for Dynamic Power Management
In this paper, a runtime performance projection model for dynamic power management is proposed. The model is built as a first-order linear equation using a linear regression model....
Sang Jeong Lee, Hae-Kag Lee, Pen-Chung Yew