Sciweavers

4934 search results - page 769 / 987
» complexity 2008
Sort
View
ADC
2008
Springer
139views Database» more  ADC 2008»
16 years 29 days 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 29 days 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...
ADHOCNOW
2008
Springer
16 years 29 days ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...
STACS
2010
Springer
15 years 11 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
160
Voted
ACNS
2010
Springer
156views Cryptology» more  ACNS 2010»
15 years 11 months ago
Batch Groth-Sahai
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
Olivier Blazy, Georg Fuchsbauer, Malika Izabach&eg...