2996 search results - page 431 / 600 » Numberings and Randomness |
162
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
145
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
175
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
Ultrasound images are corrupted by a multiplicative noise, the speckle, which makes high level analysis difficult. Within each resolution cell a number of elementary scatterers re...
147
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
157
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...