Sciweavers

4908 search results - page 751 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
SMI
2008
IEEE
118views Image Analysis» more  SMI 2008»
16 years 1 months ago
A least-norm approach to flattenable mesh surface processing
Following the definition of developable surface in differential geometry, the flattenable mesh surface, a special type of piecewiselinear surface, inherits the good property of ...
Charlie C. L. Wang
SUTC
2008
IEEE
16 years 1 months ago
An Embedded Computing Platform for Robot
As the robotic industry is growing boomingly, the functionalities and system's architecture of robots are more and more complex. The development of robotic application system...
Ching-Han Chen, Sz-Ting Liou
VTC
2008
IEEE
185views Communications» more  VTC 2008»
16 years 1 months ago
Opportunistic Spectrum Access for Energy-Constrained Cognitive Radios
This paper considers a scenario in which a secondary user makes opportunistic use of a channel allocated to some primary network. The primary network operates in a time-slotted ma...
Anh Tuan Hoang, Ying-Chang Liang, David Tung Chong...
ADC
2008
Springer
139views Database» more  ADC 2008»
16 years 1 months ago
Computing Structural Similarity of Source XML Schemas against Domain XML Schema
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Jixue Liu...
ADHOCNOW
2008
Springer
16 years 1 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...