Sciweavers

1272 search results - page 73 / 255
» The Set Cover with Pairs Problem
Sort
View
IANDC
2008
111views more  IANDC 2008»
15 years 3 months ago
Bin packing with controllable item sizes
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
José R. Correa, Leah Epstein
141
Voted
CORR
2011
Springer
222views Education» more  CORR 2011»
14 years 7 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
194
Voted
CCA
2009
Springer
15 years 8 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
ICIP
2010
IEEE
15 years 1 months ago
Towards computational models of kinship verification
We tackle the challenge of kinship verification using novel feature extraction and selection methods, automatically classifying pairs of face images as "related" or &quo...
Ruogu Fang, Kevin D. Tang, Noah Snavely, Tsuhan Ch...
136
Voted
FOCS
2004
IEEE
15 years 7 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler