2523 search results - page 300 / 505 » Objective: In Minimum Context |
174
Voted
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
184
click to vote
RSS
2007
15 years 7 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
170
click to vote
PAMI
2008
15 years 6 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
316
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...
151
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...