Sciweavers

10997 search results - page 194 / 2200
» On the Structure of Complete Sets
Sort
View
TIFS
2008
157views more  TIFS 2008»
15 years 6 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
ECCV
2002
Springer
16 years 8 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
PERCOM
2008
ACM
16 years 6 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
16 years 3 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
INFOCOM
2009
IEEE
16 years 1 months ago
A Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks
Abstract— Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the ...
Raul Landa, David Griffin, Richard G. Clegg, Eleni...