3545 search results - page 419 / 709 » Computational methods for case-cohort studies |
150
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
184
click to vote
ACSAC
1997
IEEE
15 years 10 months ago
1997
IEEE
We study methods for reducing the cost of secure link state routing. In secure link state routing, routers may need to verify the authenticity of many routing updates, and some ro...
146
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We study principled methods for incorporating user utility into the selection of sponsored search ads. We describe variations of the GSP allocation/pricing mechanism that accommod...
205
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
209
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...