Sciweavers

168 search results - page 11 / 34
» A Generalization of Hybrid Let-Polymorphic Type Inference Al...
Sort
View
ICFP
2006
ACM
14 years 7 months ago
OCaml + XDuce
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
Alain Frisch
LICS
1997
IEEE
13 years 11 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 11 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
WSDM
2012
ACM
296views Data Mining» more  WSDM 2012»
12 years 3 months ago
Inferring social ties across heterogenous networks
It is well known that different types of social ties have essentially different influence between people. However, users in online social networks rarely categorize their contact...
Jie Tang, Tiancheng Lou, Jon M. Kleinberg
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert