Sciweavers

915 search results - page 153 / 183
» Proof labeling schemes
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
WSOM
2009
Springer
14 years 2 months ago
Bag-of-Features Codebook Generation by Self-Organisation
Bag of features is a well established technique for the visual categorisation of objects, categories of objects and textures. One of the most important part of this technique is co...
Teemu Kinnunen, Joni-Kristian Kämärä...
ICPR
2008
IEEE
14 years 2 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICC
2007
IEEE
109views Communications» more  ICC 2007»
14 years 2 months ago
Real Time Detection of Link Failures in Inter Domain Routing
Abstract— Measurements have shown that network path failures occur frequently in the Internet and physical link failures can cause network instability in large scale and severity...
Xiaobo Long, Biplab Sikdar
FGR
2006
IEEE
171views Biometrics» more  FGR 2006»
14 years 2 months ago
Automatic Feature Extraction for Multiview 3D Face Recognition
Current 2D face recognition systems encounter difficulties in recognizing faces with large pose variations. Utilizing the pose-invariant features of 3D face data has the potentia...
Xiaoguang Lu, Anil K. Jain