Sciweavers

493 search results - page 70 / 99
» The oracle penalty method
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
14 years 1 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
RT
1995
Springer
14 years 1 months ago
Making Global Illumination User-friendly
Global illumination researchers tend to think in terms of mesh density and sampling frequency, and their software reflects this in its user interface. Advanced rendering systems a...
Gregory J. Ward
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 11 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
PR
2008
108views more  PR 2008»
13 years 9 months ago
From dynamic classifier selection to dynamic ensemble selection
In handwritten pattern recognition, the multiple classifier system has been shown to be useful for improving recognition rates. One of the most important tasks in optimizing a mul...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...