1174 search results - page 32 / 235 » Functional Trees |
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
SEFM
2003
IEEE
14 years 1 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
PPDP
2001
Springer
14 years 1 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
AMAST
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...