Sciweavers

17329 search results - page 212 / 3466
» Improved non-approximability results
Sort
View
MC
2007
13 years 11 months ago
Shifts in Significance: How Group Dynamics Improves Group Awareness
Appropriate awareness support has been an issue in the area of Computer-Supported Cooperative Work (CSCW) for quite a while. Yet, many challenges like the dual trade-off between a...
Christoph Oemig, Tom Gross
MVA
2007
186views Computer Vision» more  MVA 2007»
13 years 11 months ago
Improving Rotation Invariance of the Volume Local Binary Pattern Operator
Dynamic texture is an extension of texture to the temporal domain. Recently, a powerful method for dynamic texture recognition based on volume local binary patterns (VLBP) was pro...
Guoying Zhao, Matti Pietikäinen
AAAI
2006
13 years 11 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
ACL
2004
13 years 11 months ago
Improving Pronoun Resolution by Incorporating Coreferential Information of Candidates
Coreferential information of a candidate, such as the properties of its antecedents, is important for pronoun resolution because it reflects the salience of the candidate in the l...
Xiaofeng Yang, Jian Su, Guodong Zhou, Chew Lim Tan
ACL
2006
13 years 11 months ago
Minority Vote: At-Least-N Voting Improves Recall for Extracting Relations
Several NLP tasks are characterized by asymmetric data where one class label NONE, signifying the absence of any structure (named entity, coreference, relation, etc.) dominates al...
Nanda Kambhatla