Sciweavers

2349 search results - page 255 / 470
» Performing time-sensitive network experiments
Sort
View
EMMCVPR
2003
Springer
15 years 9 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
MOMM
2009
ACM
129views Communications» more  MOMM 2009»
15 years 8 months ago
Sharing large data collections between mobile peers
New directions in the provision of end-user computing experiences mean that we need to determine the best way to share data between small mobile computing devices. Partitioning la...
Brian Tripney, Christopher Foley, Richard Gourlay,...
TIFS
2008
102views more  TIFS 2008»
15 years 4 months ago
Use of Identification Trial Statistics for the Combination of Biometric Matchers
Combination functions typically used in biometric identification systems consider as input parameters only those matching scores which are related to a single person in order to de...
Sergey Tulyakov, Venu Govindaraju
PRIB
2010
Springer
192views Bioinformatics» more  PRIB 2010»
15 years 2 months ago
Structured Output Prediction of Anti-cancer Drug Activity
We present a structured output prediction approach for classifying potential anti-cancer drugs. Our QSAR model takes as input a description of a molecule and predicts the activity...
Hongyu Su, Markus Heinonen, Juho Rousu
90
Voted
CEC
2008
IEEE
15 years 10 months ago
Multi-level neutrality in optimization
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...
Colin G. Johnson