2485 search results - page 70 / 497 » Time Bounded Frequency Computations |
139
click to vote
IJCGA
2006
15 years 4 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
140
click to vote
SAINT
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
148
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
155
click to vote
GLVLSI
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
121
click to vote
ICCAD
2008
IEEE
16 years 1 months ago
2008
IEEE
- In this paper, we present a technique to optimize the energy-delay product of a synchronous linear pipeline circuit with dynamic error detection and correction capability running...