10988 search results - page 454 / 2198 » Algorithmic Folding Complexity |
166
click to vote
APAQS
2000
IEEE
15 years 10 months ago
2000
IEEE
The use of the statistical technique of mixture model analysis as a tool for early prediction of fault-prone program modules is investigated. The Expectation-Maximum likelihood (E...
197
click to vote
MOBIHOC
2000
ACM
15 years 10 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
160
Voted
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
194
click to vote
VRML
1997
ACM
15 years 10 months ago
1997
ACM
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
136
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...