Sciweavers

1435 search results - page 194 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 4 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
MOBICOM
2010
ACM
15 years 3 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
GIS
2006
ACM
16 years 4 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
MCS
2000
Springer
15 years 6 months ago
Combining Fisher Linear Discriminants for Dissimilarity Representations
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....
189
Voted
CCA
2009
Springer
15 years 7 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich