Sciweavers

1445 search results - page 175 / 289
» Architectures to make Simple Visualisations using Simple Sys...
Sort
View
FPCA
1989
15 years 6 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...
122
Voted
CAGD
2008
98views more  CAGD 2008»
15 years 2 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
129
Voted
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 11 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
KI
2008
Springer
15 years 2 months ago
Autonomous Learning of User's Preferences Improved through User Feedback
Ambient Intelligent (AmI) environments are supposed to act proactively anticipating the user's needs and preferences, therefore the capability of an AmI system to learn those ...
Asier Aztiria, Juan Carlos Augusto, Alberto Izagui...
121
Voted
ACL
2006
15 years 4 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning