Sciweavers

28888 search results - page 400 / 5778
» Computability and complexity in analysis
Sort
View
FLAIRS
2008
15 years 9 months ago
On Using SVM and Kolmogorov Complexity for Spam Filtering
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
Sihem Belabbes, Gilles Richard
DAGSTUHL
1997
15 years 8 months ago
Spotting Structure in Complex Time Dependent Flow
Analyzing structure in complex time dependent flow fields is a challenging problem. This paper describes the use of spot noise for the visualization of this type of fields. Spo...
Wim C. de Leeuw, Robert van Liere
ML
2002
ACM
128views Machine Learning» more  ML 2002»
15 years 6 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 5 months ago
Algebraic Multigrid Solvers for Complex-Valued Matrices
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
Scott MacLachlan, Cornelis W. Oosterlee
FOCS
2006
IEEE
16 years 27 days ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen