Sciweavers

1814 search results - page 286 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
LATIN
2010
Springer
14 years 5 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
JMLR
2008
169views more  JMLR 2008»
13 years 10 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
PLISP
1989
14 years 2 months ago
Speculative Computation in Multilisp
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
Randy B. Osborne
DAC
1994
ACM
14 years 1 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
BMVC
2001
14 years 17 days ago
A Buyer's Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
Petko Faber, Robert B. Fisher