88 search results - page 7 / 18 » Regular Cost Functions over Finite Trees |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based strategie...
109
click to vote
SIGMOD
1999
ACM
15 years 4 months ago
1999
ACM
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
CCCG
2001
15 years 1 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
116
click to vote
ALGOSENSORS
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...