Sciweavers

32 search results - page 4 / 7
» It's Time to Stop Calling Circuits
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 8 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
COMSWARE
2007
IEEE
14 years 1 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
14 years 5 days ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
INTEGRATION
2008
87views more  INTEGRATION 2008»
13 years 7 months ago
SafeResynth: A new technique for physical synthesis
Physical synthesis is a relatively young field in Electronic Design Automation. Many published optimizations for physical synthesis end up hurting the quality of the final design,...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
HPDC
2005
IEEE
14 years 1 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant