Sciweavers

17329 search results - page 3210 / 3466
» Improved non-approximability results
Sort
View
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
16 years 4 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
PPOPP
2010
ACM
16 years 3 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
PPOPP
2010
ACM
16 years 3 months ago
Scheduling support for transactional memory contention management
Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on multiple cores when the d...
Walther Maldonado, Patrick Marlier, Pascal Felber,...
MICCAI
2009
Springer
16 years 3 months ago
A Spatio-temporal Atlas of the Human Fetal Brain with Application to Tissue Segmentation
Modeling and analysis of MR images of the early developing human brain is a challenge because of the transient nature of different tissue classes during brain growth. To address th...
Piotr A. Habas, Kio Kim, François Rousseau,...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
« Prev « First page 3210 / 3466 Last » Next »