Sciweavers

5832 search results - page 607 / 1167
» Software complexity and maintainability
Sort
View
3DIM
2011
IEEE
14 years 7 months ago
Visual Hull from Imprecise Polyhedral Scene
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
Peng He, Abbas Edalat
ACII
2011
Springer
14 years 7 months ago
A Psychologically-Inspired Match-Score Fusion Model for Video-Based Facial Expression Recognition
Communication between humans is rich in complexity and is not limited to verbal signals; emotions are conveyed with gesture, pose and facial expression. Facial Emotion Recognition ...
Albert Cruz, Bir Bhanu, Songfan Yang
CVPR
2004
IEEE
16 years 9 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...
SPAA
2009
ACM
16 years 7 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder