1740 search results - page 72 / 348 » Minimal structures for stories |
NIPS
2007
15 years 1 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
107
click to vote
DSN
2007
IEEE
15 years 3 months ago
2007
IEEE
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
CGF
2010
14 years 12 months ago
2010
This paper presents a digital storytelling approach that generates automatic animations for time-varying data visualization. Our approach simulates the composition and transition ...
108
click to vote
PPOPP
2005
ACM
15 years 5 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
ICIAP
1999
ACM
15 years 4 months ago
1999
ACM
In this paper, a new deformable contour method derived from a constrained contour energy minimization framework is presented. By imposing a constraint of region, which can be any ...