Sciweavers

2366 search results - page 309 / 474
» Mapping time
Sort
View
155
Voted
SAC
2011
ACM
14 years 6 months ago
Tracking continuous topological changes of complex moving regions
A moving region whose location and extend change over time can imply topological changes such as region split and hole formation. To study this phenomenon is useful in many applic...
Hechen Liu, Markus Schneider
139
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
AUSDM
2008
Springer
238views Data Mining» more  AUSDM 2008»
15 years 5 months ago
Graphics Hardware based Efficient and Scalable Fuzzy C-Means Clustering
The exceptional growth of graphics hardware in programmability and data processing speed in the past few years has fuelled extensive research in using it for general purpose compu...
S. A. Arul Shalom, Manoranjan Dash, Minh Tue
150
Voted
SOSP
2009
ACM
16 years 12 days ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
SMC
2007
IEEE
156views Control Systems» more  SMC 2007»
15 years 9 months ago
Dynamic fusion of classifiers for fault diagnosis
—This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss d...
Satnam Singh, Kihoon Choi, Anuradha Kodali, Krishn...