11212 search results - page 482 / 2243 » Semi-persistent Data Structures |
172
click to vote
PLILP
1994
Springer
15 years 10 months ago
1994
Springer
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
145
click to vote
PARCO
2003
15 years 8 months ago
2003
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...
192
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
146
click to vote
APAL
2007
15 years 7 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
205
click to vote
FUIN
2006
15 years 6 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...