Sciweavers

359 search results - page 45 / 72
» The Parameterized Complexity of Counting Problems
Sort
View
ACTA
2002
111views more  ACTA 2002»
13 years 7 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
COMPGEOM
2005
ACM
13 years 9 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
COMPGEOM
2005
ACM
13 years 9 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
CVPR
2003
IEEE
14 years 9 months ago
Learning Object Intrinsic Structure for Robust Visual Tracking
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...
Qiang Wang, Guangyou Xu, Haizhou Ai
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
14 years 29 days ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund