Sciweavers

1094 search results - page 71 / 219
» On Computing Explanations in Argumentation
Sort
View
CHI
2004
ACM
15 years 11 months ago
Remarkable computing: the challenge of designing for the home
The vision of ubiquitous computing is floating into the domain of the household, despite arguments that lessons from design of workplace artefacts cannot be blindly transferred in...
Marianne Graves Petersen
ICPP
1987
IEEE
15 years 2 months ago
Performance of VLSI Engines for Lattice Computations
Abstract. We address the problem of designing and building efficient custom Vl.Sl-besed processors to do computations on large multi-dimensional lattices. The design tradeoffs for ...
Steven D. Kugelmass, Kenneth Steiglitz, Richard K....
IWCF
2009
Springer
15 years 5 months ago
Multimedia Forensics Is Not Computer Forensics
The recent popularity of research on topics of multimedia forensics justifies reflections on the definition of the field. This paper devises an ontology that structures forensi...
Rainer Böhme, Felix C. Freiling, Thomas Gloe,...
68
Voted
CIE
2005
Springer
15 years 4 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
RECOMB
2008
Springer
15 years 11 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye