394 search results - page 23 / 79 » Expected Case for Projecting Points |
123
click to vote
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
111
click to vote
NIPS
2001
15 years 5 months ago
2001
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
108
click to vote
OSS
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a case study of introducing usability practices to a small open source project called Carrot2 . We describe our experiences from a point of view of an active Ca...
128
click to vote
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
149
click to vote
IJCV
2002
15 years 3 months ago
2002
Visibility constraints can aid the segmentation of foreground objects in a scene observed with multiple range imagers. Points may be labeled as foreground if they can be determine...