Sciweavers

184 search results - page 25 / 37
» Wisdom
Sort
View
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 27 days ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
USENIX
2008
14 years 12 months ago
Evaluating Distributed Systems: Does Background Traffic Matter?
Evaluating novel networked protocols and services requires subjecting the target system to realistic Internet conditions. However, there is no common understanding of what is requ...
Kashi Venkatesh Vishwanath, Amin Vahdat
ACL
2008
14 years 11 months ago
Learning Bigrams from Unigrams
Traditional wisdom holds that once documents are turned into bag-of-words (unigram count) vectors, word orders are completely lost. We introduce an approach that, perhaps surprisi...
Xiaojin Zhu, Andrew B. Goldberg, Michael Rabbat, R...
EMNLP
2008
14 years 11 months ago
Learning with Compositional Semantics as Structural Inference for Subsentential Sentiment Analysis
Determining the polarity of a sentimentbearing expression requires more than a simple bag-of-words approach. In particular, words or constituents within the expression can interac...
Yejin Choi, Claire Cardie
IADIS
2004
14 years 11 months ago
Telecollaboration - a case study for performance analysis of voip systems
The evolving nature of complex traffic issues of IP (Internet Protocol)-based Telecollaboration (TC) business system technology requires an intuitive understanding for the partici...
Venkatesh Mahadevan, Zenon Chaczko