Sciweavers

2450 search results - page 75 / 490
» Mining Model Trees from Spatial Data
Sort
View
103
Voted
EOR
2006
130views more  EOR 2006»
15 years 19 days ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
59
Voted
ICPR
2004
IEEE
16 years 1 months ago
Learning Spatial Context from Tracking using Penalised Likelihoods
MAP estimation of Gaussian mixtures through maximisation of penalised likelihoods was used to learn models of spatial context. This enabled prior beliefs about the scale, orientat...
Hammadi Nait-Charif, Stephen J. McKenna
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 7 days ago
Energy-performance trade-offs for spatial access methods on memory-resident data
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
Ning An, Sudhanva Gurumurthi, Anand Sivasubramania...
140
Voted
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
16 years 1 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
102
Voted
RECOMB
2009
Springer
16 years 1 months ago
An Online Approach for Mining Collective Behaviors from Molecular Dynamics Simulations
Collective behavior involving distally separate regions in a protein is known to widely affect its function. In this paper, we present an online approach to study and characterize ...
Arvind Ramanathan, Pratul K. Agarwal, Maria Kurnik...