Sciweavers

10608 search results - page 166 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CSL
2005
Springer
14 years 3 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
COCOON
2007
Springer
14 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
14 years 3 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
AAAI
1997
13 years 11 months ago
Model Decomposition and Simulation: A Component Based Qualitative Simulation Algorithm
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...
Daniel J. Clancy, Benjamin Kuipers
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 3 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer