Sciweavers

792 search results - page 11 / 159
» Finding Cost-Efficient Adapters
Sort
View
COLT
2008
Springer
15 years 1 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
100
Voted
PAMI
2008
152views more  PAMI 2008»
14 years 11 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
15 years 12 months ago
Finding k-dominant skylines in high dimensional space
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
LCTRTS
2004
Springer
15 years 5 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
BMCBI
2004
96views more  BMCBI 2004»
14 years 11 months ago
Gene finding in novel genomes
Background: Computational gene prediction continues to be an important problem, especially for genomes with little experimental data. Results: I introduce the SNAP gene finder whi...
Ian Korf