Sciweavers

2520 search results - page 487 / 504
» The complexity of approximating entropy
Sort
View
ESANN
2006
13 years 11 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
VMV
2004
185views Visualization» more  VMV 2004»
13 years 11 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
SOSP
1997
ACM
13 years 11 months ago
Frangipani: A Scalable Distributed File System
The idealdistributed file system wouldprovide all its userswith coherent,shared access tothe samesetoffiles,yetwould be arbitrarily scalable to provide more storage space and hi...
Chandramohan A. Thekkath, Timothy Mann, Edward K. ...
WSC
2000
13 years 11 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 10 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...