Sciweavers

10293 search results - page 2014 / 2059
» Describing Semistructured Data
Sort
View
CCS
2010
ACM
13 years 11 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
ALMOB
2008
131views more  ALMOB 2008»
13 years 11 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ALMOB
2007
151views more  ALMOB 2007»
13 years 11 months ago
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. ...
AROBOTS
2007
159views more  AROBOTS 2007»
13 years 11 months ago
Structure-based color learning on a mobile robot under changing illumination
— A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. To operate in the real world, autonomo...
Mohan Sridharan, Peter Stone
BIODATAMINING
2008
135views more  BIODATAMINING 2008»
13 years 11 months ago
Fast Gene Ontology based clustering for microarray experiments
Background: Analysis of a microarray experiment often results in a list of hundreds of diseaseassociated genes. In order to suggest common biological processes and functions for t...
Kristian Ovaska, Marko Laakso, Sampsa Hautaniemi
« Prev « First page 2014 / 2059 Last » Next »