Sciweavers

1809 search results - page 87 / 362
» Weakly Computable Real Numbers
Sort
View
FOSSACS
2004
Springer
15 years 9 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
COLT
1993
Springer
15 years 8 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
PVLDB
2010
118views more  PVLDB 2010»
15 years 2 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 10 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
132
Voted
ENGL
2007
100views more  ENGL 2007»
15 years 3 months ago
Utilizing Computational Intelligence to Assist in Software Release Decision
—Defect tracking using computational intelligence methods is used to predict software readiness in this study. By comparing predicted number of faults and number of faults discov...
Tong-Seng Quah, Mie Mie Thet Thwin