Sciweavers

2069 search results - page 198 / 414
» The support vector decomposition machine
Sort
View
150
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
132
Voted
ICML
2006
IEEE
16 years 5 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
NSDI
2008
15 years 6 months ago
Ghost Turns Zombie: Exploring the Life Cycle of Web-based Malware
While the web provides information and services that enrich our lives in many ways, it has also become the primary vehicle for delivering malware. Once infected with web-based mal...
Michalis Polychronakis, Niels Provos
RE
2004
Springer
15 years 10 months ago
Composing Requirements Using Problem Frames
Problem Frames are a systematic approach to the decomposition of problems that allows us to relate requirements, domain properties, and machine specifications. Having decomposed a...
Robin C. Laney, Leonor Barroca, Michael Jackson, B...
145
Voted
CCGRID
2007
IEEE
15 years 11 months ago
Adaptive Performance Modeling on Hierarchical Grid Computing Environments
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
Wahid Nasri, Luiz Angelo Steffenel, Denis Trystram