Sciweavers

10608 search results - page 1908 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICWS
2009
IEEE
13 years 8 months ago
Discovery of Optimized Web Service Configurations Using a Hybrid Semantic and Statistical Approach
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
Maciej Zaremba, Jacek Migdal, Manfred Hauswirth
IEEEPACT
2009
IEEE
13 years 8 months ago
ITCA: Inter-task Conflict-Aware CPU Accounting for CMPs
Abstract--Chip-MultiProcessor (CMP) architectures are becoming more and more popular as an alternative to the traditional processors that only extract instruction-level parallelism...
Carlos Luque, Miquel Moretó, Francisco J. C...
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 8 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
CVPR
2011
IEEE
13 years 6 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
« Prev « First page 1908 / 2122 Last » Next »