Sciweavers

724 search results - page 43 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ICSEA
2007
IEEE
15 years 6 months ago
A Model for the Effect of Caching on Algorithmic Efficiency in Radix based Sorting
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
Arne Maus, Stein Gjessing
ESANN
2003
15 years 1 months ago
Comparison of neural algorithms for blind source separation in sensor array applications
- A test bed of experiments with real and artificially generated data has been designed to compare the performance of three well-known algorithms for BSS. The main goal of these ex...
Guillermo Bedoya, Sergio Bermejo, Joan Cabestany
ESORICS
2009
Springer
16 years 12 days ago
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new parad...
Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhaka...
PARLE
1987
15 years 3 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
Peter H. Welch
JCIT
2008
138views more  JCIT 2008»
14 years 11 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan