Sciweavers

1347 search results - page 95 / 270
» Using Clustering Methods for Discovering Event Structures
Sort
View
137
Voted
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
15 years 9 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka
INTERACT
2003
15 years 4 months ago
Desktop History: Time-based Interaction Summaries to Restore Context and Improve Data Access
The Desktop History Tool presents users with a summary of the data they worked with throughout past days and weeks. The user’s own interaction history provides an invaluable sel...
Sean Uberoi Kelly
94
Voted
ECCV
2008
Springer
16 years 4 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello
99
Voted
EVOW
2008
Springer
15 years 4 months ago
Genetic Programming in Statistical Arbitrage
Abstract. This paper employs genetic programming to discover statistical arbitrage strategies on the banking sector in the Euro Stoxx universe. Binary decision rules are evolved us...
Philip Saks, Dietmar G. Maringer
134
Voted
BMCBI
2007
133views more  BMCBI 2007»
15 years 2 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja