1201 search results - page 202 / 241 » Linear Probing and Graphs |
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
SIGSOFT
2006
ACM
14 years 11 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
VLSID
2002
IEEE
14 years 11 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
PODS
2001
ACM
14 years 11 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
ICFP
2008
ACM
14 years 11 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...