Sciweavers

2434 search results - page 195 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
TKDE
2002
133views more  TKDE 2002»
15 years 3 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 5 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
TKDE
2002
123views more  TKDE 2002»
15 years 3 months ago
Coordinated Placement and Replacement for Large-Scale Distributed Caches
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
Madhukar R. Korupolu, Michael Dahlin
JCST
2008
124views more  JCST 2008»
15 years 4 months ago
Clustering by Pattern Similarity
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
Haixun Wang, Jian Pei
121
Voted
ISBI
2002
IEEE
16 years 4 months ago
Correction for external LOR effects in listmode reconstruction for PET
In PET imaging listmode is an alternative for projections to store the acquisition data with more accuracy. The reconstruction starting from the listmode format requires different...
Stefaan Vandenberghe, Yves D'Asseler, Rik Van de W...