Sciweavers

185 search results - page 35 / 37
» Efficient frame vector selection based on ordered sets
Sort
View
CN
1998
64views more  CN 1998»
13 years 7 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 7 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
BMCBI
2006
194views more  BMCBI 2006»
13 years 7 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
FAST
2004
13 years 9 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
AFRIGRAPH
2010
ACM
13 years 11 months ago
Progressive RBF interpolation
Interpolation based on Radial Basis Functions (RBF) is very often used for scattered scalar data interpolation in n-dimensional space in general. RBFs are used for surface reconst...
Václav Skala