Sciweavers

Share
ACL
2012
7 years 16 days ago
Spectral Learning of Latent-Variable PCFGs
We introduce a spectral learning algorithm for latent-variable PCFGs (Petrov et al., 2006). Under a separability (singular value) condition, we prove that the method provides cons...
Shay B. Cohen, Karl Stratos, Michael Collins, Dean...
ACL
2012
7 years 16 days ago
Named Entity Disambiguation in Streaming Data
The named entity disambiguation task is to resolve the many-to-many correspondence between ambiguous names and the unique realworld entity. This task can be modeled as a classifi...
Alexandre Davis, Adriano Veloso, Altigran Soares d...
TMA
2012
Springer
268views Management» more  TMA 2012»
7 years 5 months ago
Identifying Skype Nodes in the Network Exploiting Mutual Contacts
Abstract. In this paper we present an algorithm that is able to progressively discover nodes of a Skype overlay P2P network. Most notably, super nodes in the network core. Starting...
Jan Jusko, Martin Rehák
ICDCN
2011
Springer
8 years 1 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
IAJIT
2011
8 years 1 months ago
DWT-based audio watermarking
: Many effective watermarking algorithms have been proposed and implemented for digital images and digital video, however, few algorithms have been proposed for audio watermarking....
Ali Al-Haj, Ahmad A. Mohammad, Lama Bata
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
8 years 1 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
INFOCOM
2011
IEEE
8 years 1 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
INFOCOM
2011
IEEE
8 years 1 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
INFOCOM
2011
IEEE
8 years 1 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
ICCABS
2011
8 years 1 months ago
Towards accelerating molecular modeling via multi-scale approximation on a GPU
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
Mayank Daga, Wu-chun Feng, Thomas Scogland
books