Sciweavers

3713 search results - page 502 / 743
» Constructing a Calculus of Programs
Sort
View
EOR
2006
83views more  EOR 2006»
15 years 4 months ago
The Rose-Gurewitz-Fox approach applied for patents classification
We used the so-called deterministic annealing algorithm due to Rose and Gurewitz by the classification of patent documents. A C++ program based on this algorithm was run first on s...
Ioan Bogdan Hodrea, Radu Ioan Bot, Gert Wanka
JGO
2008
53views more  JGO 2008»
15 years 4 months ago
Smoothing by mollifiers. Part II: nonlinear optimization
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
Hubertus Th. Jongen, Oliver Stein
JBI
2006
107views Bioinformatics» more  JBI 2006»
15 years 4 months ago
KDE Bioscience: Platform for bioinformatics analysis workflows
Bioinformatics is a dynamic research area in which a large number of algorithms and programs have been developed rapidly and independently without much consideration so far of the...
Qiang Lu, Pei Hao, Vasa Curcin, Wei-Zhong He, Yuan...
LISP
2006
91views more  LISP 2006»
15 years 3 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
ECCC
2002
103views more  ECCC 2002»
15 years 3 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák