Sciweavers

187 search results - page 1 / 38
» Structural Results For Planar Sets With Many Similar Subsets
Sort
View
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 7 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
BMCBI
2005
103views more  BMCBI 2005»
13 years 7 months ago
Many accurate small-discriminatory feature subsets exist in microarray transcript data: biomarker discovery
Background: Molecular profiling generates abundance measurements for thousands of gene transcripts in biological samples such as normal and tumor tissues (data points). Given such...
Leslie Grate
ICPR
2008
IEEE
14 years 2 months ago
Re-ranking of web image search results using a graph algorithm
We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks ...
Hilal Zitouni, Sare Gul Sevil, Derya Ozkan, Pinar ...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ICML
2008
IEEE
14 years 8 months ago
Predicting diverse subsets using structural SVMs
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
Yisong Yue, Thorsten Joachims