Sciweavers

6181 search results - page 664 / 1237
» Transactional Cluster Computing
Sort
View
DATAMINE
1998
175views more  DATAMINE 1998»
15 years 7 months ago
A Microeconomic View of Data Mining
We present a rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decisionmaking. Thi...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
COLING
2010
15 years 2 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
IPPS
2006
IEEE
16 years 1 months ago
Monitoring remotely executing shared memory programs in software DSMs
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...
Long Fei, Xing Fang, Y. Charlie Hu, Samuel P. Midk...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
ADHOC
2007
139views more  ADHOC 2007»
15 years 7 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...