Sciweavers

15073 search results - page 2544 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
MOBIHOC
2010
ACM
15 years 4 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
WINE
2010
Springer
154views Economy» more  WINE 2010»
15 years 4 months ago
The Good, The Bad and The Cautious: Safety Level Cooperative Games
Abstract. We study safety level coalitions in competitive games. Given a normal form game, we define a corresponding cooperative game with transferable utility, where the value of ...
Yoram Bachrach, Maria Polukarov, Nicholas R. Jenni...
ACL
2009
15 years 4 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
ACL
2009
15 years 4 months ago
A Novel Discourse Parser Based on Support Vector Machine Classification
This paper introduces a new algorithm to parse discourse within the framework of Rhetorical Structure Theory (RST). Our method is based on recent advances in the field of statisti...
David duVerle, Helmut Prendinger
« Prev « First page 2544 / 3015 Last » Next »