Sciweavers

315 search results - page 29 / 63
» Reasoning about Assignments in Recursive Data Structures
Sort
View
ECCC
2007
144views more  ECCC 2007»
15 years 5 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 10 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
ICFP
2005
ACM
16 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
TMC
2012
13 years 8 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
MCS
2010
Springer
15 years 7 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke