15073 search results - page 67 / 3015 » Probabilistic algorithms for computing resultants |
GCC
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
141
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
124
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
147
click to vote
COMGEO
2002
ACM
15 years 3 months ago
2002
ACM
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
125
click to vote
EDBT
2011
ACM
14 years 6 months ago
2011
ACM
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...