Sciweavers

316 search results - page 48 / 64
» Bounded Depth Data Trees
Sort
View
CCCG
2008
13 years 10 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...
IPPS
2009
IEEE
14 years 3 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...
GFKL
2007
Springer
137views Data Mining» more  GFKL 2007»
14 years 1 months ago
Families of Dendrograms
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...
Patrick Erik Bradley
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 2 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
ATAL
2010
Springer
13 years 10 months ago
Multi robotic exploration with communication requirement to a fixed base station
d Abstract) Piyoosh Mukhija IIIT Hyderabad Rahul Sawhney IIIT Hyderabad K Madhava Krishna IIIT Hyderabad We present an algorithm for multi robotic exploration of an unknown terrai...
Piyoosh Mukhija, Rahul Sawhney, K. Madhava Krishna