Sciweavers

1012 search results - page 99 / 203
» Segment intersection searching problems in general settings
Sort
View
WAPCV
2004
Springer
15 years 9 months ago
Distributed Control of Attention
Detection of objects is in general a computationally demanding task. To simplify the problem it is of interest to focus the attention to a set of regions of interest. Indoor enviro...
Ola Ramström, Henrik I. Christensen
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 4 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 4 months ago
Choosing Multiple Parameters for Support Vector Machines
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...
MP
2010
126views more  MP 2010»
15 years 2 months ago
Two row mixed-integer cuts via lifting
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
Santanu S. Dey, Laurence A. Wolsey
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
15 years 1 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...