Sciweavers

16404 search results - page 703 / 3281
» A set coverage problem
Sort
View
CAD
2011
Springer
15 years 2 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
ICCV
2007
IEEE
16 years 9 months ago
Global Optimization through Searching Rotation Space and Optimal Estimation of the Essential Matrix
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
Richard I. Hartley, Fredrik Kahl
ICML
2007
IEEE
16 years 8 months ago
Supervised clustering of streaming data for email batch detection
We address the problem of detecting batches of emails that have been created according to the same template. This problem is motivated by the desire to filter spam more effectivel...
Peter Haider, Ulf Brefeld, Tobias Scheffer
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
16 years 2 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee
213
Voted
ICNSC
2008
IEEE
16 years 1 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi