Sciweavers

7092 search results - page 1145 / 1419
» Parallelizing constraint programs
Sort
View
125
Voted
IFIP
2004
Springer
15 years 8 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
116
Voted
IWMM
2004
Springer
127views Hardware» more  IWMM 2004»
15 years 8 months ago
Garbage-first garbage collection
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high ...
David Detlefs, Christine H. Flood, Steve Heller, T...
129
Voted
APCSAC
2003
IEEE
15 years 7 months ago
Mapping Applications to a Coarse Grain Reconfigurable System
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...
117
Voted
CLUSTER
2003
IEEE
15 years 7 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi
155
Voted
CVPR
2003
IEEE
15 years 7 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
« Prev « First page 1145 / 1419 Last » Next »