3096 search results - page 420 / 620 » The Generalized FITC Approximation |
179
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
188
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
184
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
178
click to vote
KDD
1999
ACM
15 years 10 months ago
1999
ACM
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
183
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A novel hybrid region-based and contour-based multiple object tracking model using optical flow based elastic matching is proposed. The proposed elastic matching model is...