Sciweavers

121 search results - page 15 / 25
» Improving branch-and-cut performance by random sampling
Sort
View
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 4 months ago
A New Initial Codebook Algorithm for Learning Vector Quantization
—In this paper, a new sorting initial codebook algorithm for learning vector quantization (LVQ) based upon selforganizing feature maps (SOM) has been proposed. The basic idea is ...
Hongsong Li, Baohua Xu
EDCC
2010
Springer
15 years 3 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
JCB
2002
160views more  JCB 2002»
14 years 10 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
CVPR
2003
IEEE
15 years 3 months ago
Adaptive Pattern Discovery for Interactive Multimedia Retrieval
Relevance feedback has been an indispensable component for multimedia retrieval systems. In this paper, we present an adaptive pattern discovery method, which addresses relevance ...
Yimin Wu, Aidong Zhang
PROMISE
2010
14 years 5 months ago
On the value of learning from defect dense components for software defect prediction
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
Hongyu Zhang, Adam Nelson, Tim Menzies