Sciweavers

2969 search results - page 81 / 594
» A space efficient algorithm for group structure computation
Sort
View
MOBICOM
2003
ACM
15 years 8 months ago
Manycast: exploring the space between anycast and multicast in ad hoc networks
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
Casey Carter, Seung Yi, Prashant Ratanchandani, Ro...
IPPS
2006
IEEE
15 years 9 months ago
Structural and algorithmic issues of dynamic protocol update
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel ...
Olivier Rütti, Pawel T. Wojciechowski, Andr&e...
JDCTA
2010
228views more  JDCTA 2010»
14 years 10 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
JMLR
2010
135views more  JMLR 2010»
14 years 10 months ago
Structured Prediction Cascades
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
David Weiss, Benjamin Taskar
4OR
2006
100views more  4OR 2006»
15 years 3 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...