COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P ℓ1, . . . , ℓk indexed according to the increasing order of their slopes, we denote by d(ℓj, ...
FMCAD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
ICCD
2004
IEEE
14 years 1 months ago
2004
IEEE
In this paper we present a clustered, multiple-clock domain (CMCD) microarchitecture that combines the benefits of both clustering and Globally Asynchronous Locally Synchronous (G...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
RECOMB
2009
Springer
14 years 5 months ago
2009
Springer
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...