Sciweavers

6368 search results - page 157 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 6 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
VISUALIZATION
2002
IEEE
15 years 11 months ago
Fast Visualization of Plane-Like Structures in Voxel Data
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
Steffen Prohaska, Hans-Christian Hege
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
15 years 12 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
DAGM
2006
Springer
15 years 10 months ago
Model Selection in Kernel Methods Based on a Spectral Analysis of Label Information
Abstract. We propose a novel method for addressing the model selection problem in the context of kernel methods. In contrast to existing methods which rely on hold-out testing or t...
Mikio L. Braun, Tilman Lange, Joachim M. Buhmann
156
Voted
LPAR
2000
Springer
15 years 10 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob