Sciweavers

8298 search results - page 1316 / 1660
» On the Complexity of Numerical Analysis
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
COMPGEOM
2009
ACM
16 years 1 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
ITICSE
2009
ACM
16 years 1 months ago
Software reuse and plagiarism: a code of practice
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signi...
J. Paul Gibson
JCDL
2009
ACM
115views Education» more  JCDL 2009»
16 years 1 months ago
Using timed-release cryptography to mitigate the preservation risk of embargo periods
Due to temporary access restrictions, embargoed data cannot be refreshed to unlimited parties during the embargo time interval. A solution to mitigate the risk of data loss has be...
Rabia Haq, Michael L. Nelson
MM
2009
ACM
142views Multimedia» more  MM 2009»
16 years 1 months ago
Investigating the use of visual focus of attention for audio-visual speaker diarisation
Audio-visual speaker diarisation is the task of estimating “who spoke when” using audio and visual cues. In this paper we propose the combination of an audio diarisation syste...
Giulia Garau, Sileye O. Ba, Hervé Bourlard,...
« Prev « First page 1316 / 1660 Last » Next »