Sciweavers

2316 search results - page 338 / 464
» The many forms of hypercomputation
Sort
View
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 11 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
SC
2009
ACM
15 years 11 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
ESOP
2009
Springer
15 years 11 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...
128
Voted
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
15 years 11 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 11 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...