Sciweavers

19866 search results - page 371 / 3974
» Computing all factorizations in ***
Sort
View
ICWE
2004
Springer
16 years 6 days ago
Using Web Services to Build Context-Aware Applications in Ubiquitous Computing
Ubiquitous and mobile web applications are typically very autonomous in nature, because they rely on additional information about the user’s context. In this paper we present a g...
Gerhard Austaller, Jussi Kangasharju, Max Müh...
174
Voted
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
15 years 11 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
15 years 10 months ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...
HCI
2007
15 years 8 months ago
Enhancing Human-Computer Interaction with Embodied Conversational Agents
We survey recent research in which the impact of an embodied conversational agent on human-computer interaction has been assessed through a human evaluation. In some cases, the eva...
Mary Ellen Foster
APAL
2007
88views more  APAL 2007»
15 years 7 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias