Sciweavers

518 search results - page 87 / 104
» Beating a Random Assignment
Sort
View
ACL
2012
13 years 4 months ago
Automatic Event Extraction with Structured Preference Modeling
This paper presents a novel sequence labeling model based on the latent-variable semiMarkov conditional random fields for jointly extracting argument roles of events from texts. ...
Wei Lu, Dan Roth
ICDCS
2012
IEEE
13 years 4 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
151
Voted
RECOMB
2003
Springer
16 years 2 months ago
An integrated probabilistic model for functional prediction of proteins
We develop an integrated probabilistic model to combine protein physical interactions, genetic interactions, highly correlated gene expression network, protein complex data, and d...
Minghua Deng, Ting Chen, Fengzhu Sun
171
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
135
Voted
SECON
2007
IEEE
15 years 8 months ago
OPERA: An Optimal Progressive Error Recovery Algorithm for Wireless Sensor Networks
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...
Saad B. Qaisar, Hayder Radha