Sciweavers

884 search results - page 141 / 177
» Control structures in programs and computational complexity
Sort
View
TSP
2010
13 years 2 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
ICCS
2007
Springer
14 years 2 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
HPDC
2006
IEEE
14 years 2 months ago
Peer to peer size estimation in large and dynamic networks: A comparative study
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are charact...
Erwan Le Merrer, Anne-Marie Kermarrec, Laurent Mas...
POLICY
2001
Springer
14 years 11 days ago
The Ponder Policy Specification Language
The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databas...
Nicodemos Damianou, Naranker Dulay, Emil Lupu, Mor...
ICCS
1993
Springer
14 years 21 hour ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson