Sciweavers

10304 search results - page 1697 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
LICS
2007
IEEE
16 years 1 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba
AUSDM
2007
Springer
140views Data Mining» more  AUSDM 2007»
16 years 29 days ago
The application of data mining techniques to characterize agricultural soil profiles
The advances in computing and information storage have provided vast amounts of data. The challenge has been to extract knowledge from this raw data; this has lead to new methods ...
Leisa Armstrong, Dean Diepeveen, Rowan Maddern
CSR
2007
Springer
16 years 29 days ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
ILP
2007
Springer
16 years 28 days ago
Structural Statistical Software Testing with Active Learning in a Graph
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
Nicolas Baskiotis, Michèle Sebag
175
Voted
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
16 years 25 days ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
« Prev « First page 1697 / 2061 Last » Next »