Sciweavers

546 search results - page 52 / 110
» An operational happens-before memory model
Sort
View
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 2 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
JCRD
2006
71views more  JCRD 2006»
14 years 9 months ago
Feature Preserving Mesh Simplification Based on Corner Cutting
Abstract Most of the existing algorithms for simplifying triangular meshes might lose some important shape features of the original model, especially at low levels of the simplifie...
Zhongping Ji, Ligang Liu, Guojin Wang
DBPL
2007
Springer
102views Database» more  DBPL 2007»
15 years 4 months ago
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
15 years 1 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
14 years 4 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner