Sciweavers

2449 search results - page 225 / 490
» Tensor Embedding Methods
Sort
View
ICMLA
2008
15 years 4 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 1 months ago
Maximum likelihood mapping with spectral image registration
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
Max Pfingsthorn, Andreas Birk 0002, Sören Sch...
132
Voted
JGAA
2002
86views more  JGAA 2002»
15 years 2 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
WORDS
2002
IEEE
15 years 7 months ago
Deriving Interaction-Prone Scenarios in Feature Interaction Filtering with Use Case Maps
Feature interactions (FIs, in short) occur when features of different communication services interfere with each other. The FI filtering is a pre-processing before the FI detecti...
Masahide Nakamura, Pattara Leelaprute, Tohru Kikun...
106
Voted
ECRTS
1999
IEEE
15 years 7 months ago
Performance of algorithms for scheduling real-time systems with overrun and overload
This paper compares the performance of three classes of scheduling algorithms for real-time systems in which jobs may overrun their allocated processor time potentially causing th...
Mark K. Gardner, Jane W.-S. Liu