1458 search results - page 71 / 292 » Monads for incremental computing |
147
click to vote
COMPGEOM
2009
ACM
16 years 20 days ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
152
click to vote
CLUSTER
2008
IEEE
16 years 19 days ago
2008
IEEE
—In this paper, we describe a whole-system live migration scheme, which transfers the whole system run-time state, including CPU state, memory data, and local disk storage, of th...
156
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
179
click to vote
VL
2006
IEEE
16 years 5 days ago
2006
IEEE
Now that we have end-user programming environments capable of empowering kids with no programming background to build games in a matter of hours, a new quest for raising the ceili...
184
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...