Sciweavers

895 search results - page 144 / 179
» Approximate convex decomposition
Sort
View
75
Voted
IROS
2007
IEEE
136views Robotics» more  IROS 2007»
15 years 4 months ago
A bounded uncertainty approach to cooperative localization using relative bearing constraints
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
Camillo J. Taylor, John R. Spletzer
DAWAK
2007
Springer
15 years 3 months ago
MOSAIC: A Proximity Graph Approach for Agglomerative Clustering
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
Jiyeon Choo, Rachsuda Jiamthapthaksin, Chun-Sheng ...
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 3 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
76
Voted
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
15 years 3 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
ECSQARU
2001
Springer
15 years 2 months ago
New Semantics for Quantitative Possibility Theory
New semantics for numerical values given to possibility measures are provided. For epistemic possibilities, the new approach is based on the semantics of the transferable belief m...
Didier Dubois, Henri Prade, Philippe Smets