Sciweavers

5608 search results - page 189 / 1122
» On the Theory of Matchgate Computations
Sort
View
RECOMB
2010
Springer
14 years 11 months ago
Ultra-Perfect Sorting Scenarios
Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definitio...
Aïda Ouangraoua, Anne Bergeron, Krister M. Sw...
ACS
2011
14 years 9 months ago
The Patch Construction is Dual to Algebraic DCPO Representation
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
Christopher F. Townsend
EJIS
2006
108views more  EJIS 2006»
15 years 1 months ago
New frontiers for information systems research: computer art as an information system
This paper proposes extending the frontiers of information systems (IS) research by seeing computer art as a kind of information system. It explores some research questions that a...
Briony J. Oates
117
Voted
CIE
2007
Springer
15 years 8 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li
112
Voted
CHI
2003
ACM
16 years 2 months ago
Media inequality in conversation: how people behave differently when interacting with computers and people
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
Nicole Shechtman, Leonard M. Horowitz