Sciweavers

16430 search results - page 203 / 3286
» On Computable Tree Functions
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 11 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
660
Voted

Lab
2057views
15 years 11 months ago
People in Computer Vision
Here is a list of computer vision researchers in a tree structure, where the links indicate advisor-advisee (or post-doc) relationship. This is for sure not a comprehensive list of...
RTSS
1992
IEEE
15 years 8 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
EOR
2007
100views more  EOR 2007»
15 years 4 months ago
Parallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
Rommel G. Regis, Christine A. Shoemaker
123
Voted
TRANSCI
2008
80views more  TRANSCI 2008»
15 years 3 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...