Sciweavers

6769 search results - page 1103 / 1354
» A new concept of robustness
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 10 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
MICRO
1996
IEEE
96views Hardware» more  MICRO 1996»
15 years 10 months ago
Exceeding the Dataflow Limit via Value Prediction
For decades, the serialization constraints imposed by true data dependences have been regarded as an absolute limit--the dataflow limit--on the parallel execution of serial progra...
Mikko H. Lipasti, John Paul Shen
RTSS
1996
IEEE
15 years 10 months ago
Scheduling transactions with temporal constraints: exploiting data semantics
In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time co...
Ming Xiong, Rajendran M. Sivasankaran, John A. Sta...
VISUALIZATION
1996
IEEE
15 years 10 months ago
BLaC-Wavelets: A Multiresolution Analysis With Non-Nested Spaces
In the last ve years, there has been numerous applications of wavelets and multiresolution analysis in many elds of computer graphics as di erent as geometric modelling, volume vi...
Georges-Pierre Bonneau, Stefanie Hahmann, Gregory ...
ICCBR
1997
Springer
15 years 10 months ago
Examining Locally Varying Weights for Nearest Neighbor Algorithms
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
Nicholas Howe, Claire Cardie
« Prev « First page 1103 / 1354 Last » Next »