Sciweavers

2335 search results - page 333 / 467
» Type Checking Type Classes
Sort
View
169
Voted
JOT
2007
138views more  JOT 2007»
15 years 2 months ago
Flexible Language Interoperability
machines raise the abstraction level of the execution environment at the cost of restricting the set of supported languages. Moreover, the ability of a language implementation to i...
Torbjörn Ekman, Peter Mechlenborg, Ulrik Pagh...
161
Voted
CN
2002
98views more  CN 2002»
15 years 2 months ago
Modeling random early detection in a differentiated services network
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state go...
Alhussein A. Abouzeid, Sumit Roy
105
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 2 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
144
Voted
PAMI
2007
106views more  PAMI 2007»
15 years 2 months ago
From Template to Image: Reconstructing Fingerprints from Minutiae Points
—Most fingerprint-based biometric systems store the minutiae template of a user in the database. It has been traditionally assumed that the minutiae template of a user does not r...
Arun Ross, Jidnya Shah, Anil K. Jain
IJFCS
2010
60views more  IJFCS 2010»
15 years 1 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (...
Andreas Maletti, Catalin Ionut Tîrnauca