5019 search results - page 838 / 1004 » Computing in Quotient Groups |
200
click to vote
IPCO
2008
15 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
178
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
178
click to vote
SIROCCO
2008
15 years 8 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
197
click to vote
NIPS
2007
15 years 8 months ago
2007
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
197
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...