Sciweavers

3958 search results - page 578 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
TPDS
2008
125views more  TPDS 2008»
15 years 6 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
SOCIALCOM
2010
15 years 4 months ago
Precursors and Laggards: An Analysis of Semantic Temporal Relationships on a Blog Network
We explore the hypothesis that it is possible to obtain information about the dynamics of a blog network by analysing the temporal relationships between blogs at a semantic level, ...
Telmo Menezes, Camille Roth, Jean-Philippe Cointet
JSAC
2011
184views more  JSAC 2011»
15 years 1 months ago
Goodput Enhancement of VANETs in Noisy CSMA/CA Channels
— The growing interest in vehicular ad hoc networks (VANETs) enables decentralized traveler information systems to become more feasible and effective in Intelligent Transportatio...
Yusun Chang, Christopher P. Lee, John A. Copeland
PVLDB
2010
195views more  PVLDB 2010»
15 years 1 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
EMNLP
2011
14 years 6 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez