Sciweavers

2735 search results - page 390 / 547
» Comparing notions of randomness
Sort
View
PERCOM
2006
ACM
16 years 12 days ago
Node Clustering in Mobile Peer-to-Peer Multihop Networks
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes an...
Chansu Yu, Kang G. Shin, Ben Lee, Seung-Min Park, ...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 10 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
94
Voted
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
15 years 10 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz
ALT
2001
Springer
15 years 9 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara
79
Voted
ICCD
2008
IEEE
117views Hardware» more  ICCD 2008»
15 years 9 months ago
Two dimensional highly associative level-two cache design
High associativity is important for level-two cache designs [9]. Implementing CAM-based Highly Associative Caches (CAM-HAC), however, is both costly in hardware and exhibits poor s...
Chuanjun Zhang, Bing Xue