Sciweavers

9209 search results - page 228 / 1842
» Data Space Randomization
Sort
View
CVPR
2000
IEEE
16 years 8 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
248
Voted
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 6 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
INTERACT
2003
15 years 7 months ago
Navigation in Hypermedia and Geographic Space, Same or Different?
: This paper presents both a theoretical analysis of differences between geographic and hypermedia spaces, and some experimental data comparing users’ ability to navigate in hype...
Nils Dahlbäck
ECCV
2010
Springer
15 years 6 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
CLUSTER
2002
IEEE
15 years 11 months ago
Compiling Tiled Iteration Spaces for Clusters
This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transformatio...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...