Sciweavers

1003 search results - page 33 / 201
» Type Inference with Inequalities
Sort
View
113
Voted
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
15 years 9 months ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...
149
Voted
AAAI
2007
15 years 5 months ago
Semantic Inference at the Lexical-Syntactic Level
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
Roy Bar-Haim, Ido Dagan, Iddo Greental, Eyal Shnar...
134
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Relative Distance Based Localization for Mobile Sensor Networks
— Many sensor network applications exploit the mobility of sensor nodes and the location-awareness plays an important role in these applications. However, it is too expensive to ...
Ji Luo, Qian Zhang
132
Voted
ESOP
2007
Springer
15 years 7 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
141
Voted
ICML
2007
IEEE
16 years 4 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara