Sciweavers

365 search results - page 35 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
BROADNETS
2004
IEEE
14 years 7 days ago
Fault Management with Fast Restoration for Optical Burst Switched Networks
This paper studies the important fault management issue with focus on the fast restoration mechanisms for Optical Burst Switched (OBS) networks. In order to reduce the burst losse...
Yufeng Xin, Jing Teng, Gigi Karmous-Edwards, Georg...
ICDCS
2010
IEEE
14 years 12 days ago
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
Hongyu Zhou, Su Xia, Miao Jin, Hongyi Wu
DIM
2005
ACM
13 years 10 months ago
Usable presentation of secure pseudonyms
Privacy-Enhancing Identity Management (PIM) enables users to control which personal information they provide to their communication partner(s) by partitioning their personal infor...
Katrin Borcea-Pfitzmann, Elke Franz, Andreas Pfitz...
ECCV
2008
Springer
14 years 10 months ago
Stereo Matching: An Outlier Confidence Approach
One of the major challenges in stereo matching is to handle partial occlusions. In this paper, we introduce the Outlier Confidence (OC) which dynamically measures how likely one pi...
Li Xu, Jiaya Jia
CIKM
2005
Springer
14 years 2 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima