10608 search results - page 1908 / 2122 » Complexity of O'Hara's Algorithm |
128
Voted
ICWS
2009
IEEE
15 years 14 days ago
2009
IEEE
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...
128
Voted
IEEEPACT
2009
IEEE
15 years 14 days ago
2009
IEEE
Abstract--Chip-MultiProcessor (CMP) architectures are becoming more and more popular as an alternative to the traditional processors that only extract instruction-level parallelism...
137
Voted
CC
2010
Springer
15 years 6 days ago
2010
Springer
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...
120
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
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...
151
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...