Sciweavers

8437 search results - page 240 / 1688
» Preferences over Sets
Sort
View
CGO
2006
IEEE
15 years 10 months ago
2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensiv...
Hyesoon Kim, M. Aater Suleman, Onur Mutlu, Yale N....
COMPGEOM
2008
ACM
15 years 8 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
PVLDB
2010
126views more  PVLDB 2010»
15 years 5 months ago
Set Similarity Join on Probabilistic Data
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
Xiang Lian, Lei Chen 0002
ICCV
2005
IEEE
16 years 8 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
16 years 2 days ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek