Sciweavers

2485 search results - page 374 / 497
» Time Bounded Frequency Computations
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
ATAL
2004
Springer
14 years 1 months ago
RDS: Remote Distributed Scheme for Protecting Mobile Agents
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...
Asnat Dadon-Elichai
ARITH
2003
IEEE
14 years 1 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
IEEEPACT
1998
IEEE
14 years 7 days ago
Athapascan-1: On-Line Building Data Flow Graph in a Parallel Language
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
François Galilée, Jean-Louis Roch, G...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 3 days ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan