Sciweavers

1097 search results - page 111 / 220
» Partial evaluation of Maple
Sort
View
COLT
2004
Springer
15 years 10 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CODES
2001
IEEE
15 years 10 months ago
Development cost and size estimation starting from high-level specifications
This paper addresses the problem of estimating cost and development effort of a system, starting from its complete or partial high-level description. In addition, some modificatio...
William Fornaciari, Fabio Salice, Umberto Bondi, E...
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...
RT
2000
Springer
15 years 10 months ago
Exact Illumination in Polygonal Environments using Vertex Tracing
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
Michael M. Stark, Richard F. Riesenfeld
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 9 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...