Sciweavers

2783 search results - page 87 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
MICRO
2008
IEEE
93views Hardware» more  MICRO 2008»
15 years 1 months ago
What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The "Useful Arts" Requirement
of nature, or abstract idea (collectively, a principle). The clue to the patent-eligibility of processes that do not involve substance-transformation is whether the process impleme...
Richard Stern
OOPSLA
2010
Springer
14 years 11 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman
TARK
2005
Springer
15 years 6 months ago
Order independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
Krzysztof R. Apt
MOC
2000
113views more  MOC 2000»
15 years 1 months ago
A finite element approximation for a class of degenerate elliptic equations
In this paper we exhibit a finite element method fitting a suitable geometry naturally associated with a class of degenerate elliptic equations (usually called Grushin type equatio...
Bruno Franchi, Maria Carla Tesi
MT
2000
124views more  MT 2000»
15 years 1 months ago
Nine Issues in Speech Translation
This paper sketches the author's research in nine areas related to speech translation: interactive disambiguation (two demonstrations of highly-interactive, broad-coverage sp...
Mark Seligman