Sciweavers

4266 search results - page 458 / 854
» The container loading problem
Sort
View
CVIU
2008
229views more  CVIU 2008»
15 years 6 months ago
Estimating pedestrian counts in groups
The goal of this work is to provide a system which can aid in monitoring crowded urban environments, which often contain tight groups of people. In this paper, we consider the pro...
Prahlad Kilambi, Evan Ribnick, Ajay J. Joshi, Osam...
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
15 years 6 months ago
On stability of second-order quasi-polynomials with a single delay
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are lim...
Efim Malakhovski, Leonid Mirkin
COMGEO
2006
ACM
15 years 6 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert
DKE
2006
99views more  DKE 2006»
15 years 6 months ago
How to act on inconsistent news: Ignore, resolve, or reject
Inconsistencies frequently occur in news about the real-world. Some of these inconsistencies may be more significant than others, and some news may contain more inconsistencies th...
Anthony Hunter
DM
2006
86views more  DM 2006»
15 years 6 months ago
Minimal rankings and the arank number of a path
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...