11565 search results - page 2047 / 2313 » Computing Minimal Mappings |
190
click to vote
DIS
2007
Springer
16 years 25 days ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
172
click to vote
TAMC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
194
click to vote
CCGRID
2006
IEEE
16 years 22 days ago
2006
IEEE
With the increasing number of processors in modern HPC(High Performance Computing) systems, there are two emergent problems to solve. One is scalability, the other is fault tolera...
154
click to vote
IJCNN
2006
IEEE
16 years 20 days ago
2006
IEEE
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
213
click to vote
P2P
2006
IEEE
16 years 20 days ago
2006
IEEE
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...