Sciweavers

633 search results - page 47 / 127
» Locality and Hard SAT-Instances
Sort
View
CVPR
2009
IEEE
15 years 5 months ago
Joint and Implicit Registration for Face Recognition
Contemporary face recognition algorithms rely on precise localization of keypoints (corner of eye, nose etc.). Unfortunately, finding keypoints reliably and accurately remains a...
Peng Li, Simon J. D. Prince
PCM
2005
Springer
123views Multimedia» more  PCM 2005»
14 years 3 months ago
Adaptive Vertex Chasing for the Lossless Geometry Coding of 3D Meshes
We present a new lossless geometry coding method for 3D triangle-quad meshes, Adaptive Vertex Chasing. Previous localized geometry coding methods have demonstrated better compressi...
Haeyoung Lee, Sujin Park
CCS
2008
ACM
13 years 12 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
EWCBR
2008
Springer
13 years 11 months ago
Evaluation Measures for TCBR Systems
Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are neede...
M. A. Raghunandan, Nirmalie Wiratunga, Sutanu Chak...
RTS
2010
103views more  RTS 2010»
13 years 8 months ago
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
This article presents a detailed discussion of LRE-TL (Local Remaining Execution - TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with uncon...
Shelby Funk