Sciweavers

ICDCS
1995
IEEE
14 years 1 months ago
A Distributed K-Mutual Exclusion Algorithm
This paper presents a token-based K-mutual exchsion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token r...
Shailaja Bulgannawar, Nitin H. Vaidya
ICCV
1995
IEEE
14 years 1 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker
ICCV
1995
IEEE
14 years 1 months ago
Recovering Object Surfaces from Viewed Changes in Surface Texture Patterns
This paper explores the reconstruction of object surfaces from viewed changes in surface texture patterns. Our approach differs from those in the past in that instead of simply pr...
Peter N. Belhumeur, Alan L. Yuille
ICALP
1995
Springer
14 years 1 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis
HPDC
1995
IEEE
14 years 1 months ago
A High Speed Implementation of Adaptive Shaping for Dynamic Bandwidth Allocation
Most algorithms proposed for controlling traffic prior to entering ATM networks are based on static mechanisms. Such static control mechanisms do not account for the dynamics of ...
Cameron Braun, V. Sirkay, H. Uriona, Srini W. Seet...
ICTAI
1997
IEEE
14 years 1 months ago
Exploiting Symbolic Techniques within Genetic Algorithms for Power Optimization
This paper proposes an optimization algorithm for reducing the power dissipation in a sequential circuit. The encoding of the different states in a Finite State Machine is modifie...
S. Chuisano, Fulvio Corno, Paolo Prinetto, Maurizi...
GOSLER
1995
14 years 1 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
FSTTCS
1995
Springer
14 years 1 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
FOCS
1995
IEEE
14 years 1 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
DAGM
1995
Springer
14 years 1 months ago
Learning Weights in Discrimination Functions Using a priori Constraints
We introduce a learning algorithm for the weights in a very common class of discrimination functions usually called weighted average". Di erent submodules are produced by som...
Norbert Krüger