Sciweavers

88 search results - page 7 / 18
» Regular Cost Functions over Finite Trees
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 9 months ago
The finite-dimensional Witsenhausen counterexample
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...
Pulkit Grover, Se Yong Park, Anant Sahai
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
14 years 1 months ago
BOAT-Optimistic Decision Tree Construction
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 ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
ICCV
2007
IEEE
14 years 11 months ago
Finite-Element Level-Set Curve Particles
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...
Tingting Jiang, Carlo Tomasi
CCCG
2001
13 years 11 months ago
Nearest neighbor search through function minimization
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...
Chang Shu, Michael A. Greenspan, Guy Godin
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
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...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...