Sciweavers

4536 search results - page 212 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
TCS
2011
13 years 4 months ago
Highly concurrent multi-word synchronization
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
Hagit Attiya, Eshcar Hillel
ICML
2006
IEEE
14 years 10 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
CSDA
2006
100views more  CSDA 2006»
13 years 9 months ago
Identification of interaction patterns and classification with applications to microarray data
Emerging patterns represent a class of interaction structures which has been recently proposed as a tool in data mining. In this paper, a new and more general definition refering ...
Anne-Laure Boulesteix, Gerhard Tutz
GMP
2008
IEEE
114views Solid Modeling» more  GMP 2008»
14 years 4 months ago
Detection of Planar Regions in Volume Data for Topology Optimization
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
Ulrich Bauer, Konrad Polthier
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 4 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li