Sciweavers

4908 search results - page 673 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 6 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
DKE
2007
101views more  DKE 2007»
15 years 6 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
JSW
2008
95views more  JSW 2008»
15 years 6 months ago
Architecture Support for Behavior-based Adaptive Checkpointing
Checkpointing is a commonly used approach to provide system fault-tolerance. However, using a constant checkpointing frequency may compromise the system's overall performance ...
Nianen Chen, Shangping Ren
192
Voted
DPD
2007
84views more  DPD 2007»
15 years 6 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin