Results 1  10
of
5,615
Bricks: Laying the foundations for graspable user interfaces
, 1995
"... We introduce the concept of Graspable User Interfaces which allow direct control of electronic or virtual objects through physical handles for control. These physical artifacts are essentially new input devices which can be tightly coupled or “attached ” to virtual objects for manipulation or for ex ..."
Abstract

Cited by 522 (28 self)
 Add to MetaCart
We introduce the concept of Graspable User Interfaces which allow direct control of electronic or virtual objects through physical handles for control. These physical artifacts are essentially new input devices which can be tightly coupled or “attached ” to virtual objects for manipulation
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
approach however is closest to Severi's incomplete proof ([Se], Anhang F; the error is on pp. 344345 and seems to be quite basic) and follows a suggestion of Grothendieck for using the result in char. o to deduce the result in char. p. The basis of both Severi's and Grothendieck's ideas
Data Mining Approaches for Intrusion Detection,
 in the 7th USENIX Security Symposium,
, 1998
"... Abstract In this paper we discuss our research in developing general and systematic methods for intrusion detection. The key ideas are to use data mining techniques to discover consistent and useful patterns of system features that describe program and user behavior, and use the set of relevant sys ..."
Abstract

Cited by 435 (23 self)
 Add to MetaCart
Abstract In this paper we discuss our research in developing general and systematic methods for intrusion detection. The key ideas are to use data mining techniques to discover consistent and useful patterns of system features that describe program and user behavior, and use the set of relevant
Natural semantics
 In Proc. 4th Annual Symp. Theoretical Aspects of Computer Science, number 247 in Lect. Notes in Comp. Sci
, 1987
"... During the past few years, many researchers have begun to present semantic specifications in a style that has been strongly advocated by Plotkin in [19]. The purpose of this paper is to introduce in an intuitive manner the essential ideas of the method that we call now Natural Semantics ~ together w ..."
Abstract

Cited by 350 (2 self)
 Add to MetaCart
During the past few years, many researchers have begun to present semantic specifications in a style that has been strongly advocated by Plotkin in [19]. The purpose of this paper is to introduce in an intuitive manner the essential ideas of the method that we call now Natural Semantics ~ together
Weighted Essentially NonOscillatory Schemes
, 1994
"... In this paper we introduce a new version of ENO (Essentially NonOscillatory) shockcapturing schemes which we call Weighted ENO. The main new idea is that, instead of choosing the "smoothest" stencil to pick one interpolating polynomial for the ENO reconstruction, we use a convex combinati ..."
Abstract

Cited by 326 (8 self)
 Add to MetaCart
In this paper we introduce a new version of ENO (Essentially NonOscillatory) shockcapturing schemes which we call Weighted ENO. The main new idea is that, instead of choosing the "smoothest" stencil to pick one interpolating polynomial for the ENO reconstruction, we use a convex
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 412 (38 self)
 Add to MetaCart
In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order
Randomized Experiments from Nonrandom Selection in the U.S. House Elections
 Journal of Econometrics
, 2008
"... This paper establishes the relatively weak conditions under which causal inferences from a regressiondiscontinuity (RD) analysis can be as credible as those from a randomized experiment, and hence under which the validity of the RD design can be tested by examining whether or not there is a discont ..."
Abstract

Cited by 377 (17 self)
 Add to MetaCart
is as good as randomized in a local neighborhood of V = v0. These ideas are illustrated in an analysis of U.S. House elections, where the inherent uncertainty in the final vote count is plausible, which would imply that the party that wins is essentially randomized among elections decided by a narrow margin
Essentially nonoscillatory and weighted essentially nonoscillatory schemes for hyperbolic conservation laws
, 1998
"... In these lecture notes we describe the construction, analysis, and application of ENO (Essentially NonOscillatory) and WENO (Weighted Essentially NonOscillatory) schemes for hyperbolic conservation laws and related HamiltonJacobi equations. ENO and WENO schemes are high order accurate nite di ere ..."
Abstract

Cited by 270 (26 self)
 Add to MetaCart
In these lecture notes we describe the construction, analysis, and application of ENO (Essentially NonOscillatory) and WENO (Weighted Essentially NonOscillatory) schemes for hyperbolic conservation laws and related HamiltonJacobi equations. ENO and WENO schemes are high order accurate nite di
An Implementation of Narrowing Strategies
 Journal of the ACM
, 2001
"... This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic progra ..."
Abstract

Cited by 302 (116 self)
 Add to MetaCart
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic
Classes and Mixins
 In Principles of Programming Languages (POPL
, 1998
"... While classbased objectoriented programming languages provide a flexible mechanism for reusing and managing related pieces of code, they typically lack linguistic facilities for specifying a uniform extension of many classes with one set of fields and methods. As a result, programmers are unable ..."
Abstract

Cited by 286 (27 self)
 Add to MetaCart
classes, but mixins more directly encourage programming to interfaces. The paper develops these ideas within the context of Java. The results are 1. an intuitive model of an essential Java subset; 2. an extension that explains and models mixins; and 3. type soundness theorems for these languages.
Results 1  10
of
5,615