Sciweavers

1381 search results - page 76 / 277
» Structural signatures for tree data structures
Sort
View
CVPR
2008
IEEE
15 years 11 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...
ESOP
2000
Springer
15 years 1 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
MCS
2008
Springer
14 years 9 months ago
Detecting multiple mean breaks at unknown points in official time series
In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach th...
Carmela Cappelli, Richard N. Penny, William S. Rea...
SIS
2004
14 years 11 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 6 days ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray