Sciweavers

9997 search results - page 294 / 2000
» The case for crowd computing
Sort
View
GPC
2007
Springer
15 years 10 months ago
A Design of Cooperation Management System to Improve Reliability in Resource Sharing Computing Environment
Resource sharing computing is a project that realizes high performance computing by utilizing the resources of peers that are connected to the Internet. Resource sharing computing ...
Ji Su Park, Kwang-Sik Chung, Jin Gon Shon
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 6 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
RC
2007
148views more  RC 2007»
15 years 6 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
SOFSEM
2000
Springer
15 years 10 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 9 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney