Sciweavers

1174 search results - page 65 / 235
» Optimizing generics is easy!
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 10 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
NOMS
2006
IEEE
146views Communications» more  NOMS 2006»
14 years 4 months ago
BGP-Inspect - Extracting Information from Raw BGP Data
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
Dionysus Blazakis, Manish Karir, John S. Baras
AAAI
2007
14 years 9 days ago
A Mathematical Programming Formulation for Sparse Collaborative Computer Aided Diagnosis
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
Jinbo Bi, Tao Xiong
EUSFLAT
2003
13 years 11 months ago
Minimisation of the expected weighted number of jobs being late with fuzzy processing time in a one machine system
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...
Barbara Gladysz, Dorota Kuchta
SCIA
2011
Springer
216views Image Analysis» more  SCIA 2011»
13 years 24 days ago
Triangulating a Plane
Abstract. In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to...
Carl Olsson, Anders Eriksson