Sciweavers

2316 search results - page 32 / 464
» The many forms of hypercomputation
Sort
View
132
Voted
EMNLP
2010
15 years 2 months ago
Predicting the Semantic Compositionality of Prefix Verbs
In many applications, replacing a complex word form by its stem can reduce sparsity, revealing connections in the data that would not otherwise be apparent. In this paper, we focu...
Shane Bergsma, Aditya Bhargava, Hua He, Grzegorz K...
181
Voted
SDM
2012
SIAM
305views Data Mining» more  SDM 2012»
13 years 6 months ago
Learning Hierarchical Relationships among Partially Ordered Objects with Heterogeneous Attributes and Links
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
Chi Wang, Jiawei Han, Qi Li, Xiang Li, Wen-Pin Lin...
109
Voted
WWW
2007
ACM
16 years 4 months ago
Exploring social dynamics in online media sharing
It is now feasible to view media at home as easily as text-based pages were viewed when the World Wide Web (WWW) first emerged. This development has supported media sharing and se...
Martin Halvey, Mark T. Keane
POPL
2002
ACM
16 years 4 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ERSHOV
2001
Springer
15 years 8 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema