Sciweavers

26354 search results - page 164 / 5271
» How we refactor, and how we know it
Sort
View
NN
2000
Springer
161views Neural Networks» more  NN 2000»
13 years 10 months ago
How good are support vector machines?
Support vector (SV) machines are useful tools to classify populations characterized by abrupt decreases in density functions. At least for one class of Gaussian data model the SV ...
Sarunas Raudys
DAM
1999
137views more  DAM 1999»
13 years 10 months ago
How to Find a Point on a Line Within a Fixed Distance
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
Christoph A. Hipke, Christian Icking, Rolf Klein, ...
IJISEC
2010
87views more  IJISEC 2010»
13 years 9 months ago
How to construct identity-based signatures without the key escrow problem
The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by a...
Tsz Hon Yuen, Willy Susilo, Yi Mu
LPAR
2010
Springer
13 years 9 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
ACL
2010
13 years 8 months ago
How Spoken Language Corpora Can Refine Current Speech Motor Training Methodologies
The growing availability of spoken language corpora presents new opportunities for enriching the methodologies of speech and language therapy. In this paper, we present a novel ap...
Daniil Umanski, Federico Sangati