Sciweavers

241 search results - page 19 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
ICIP
2010
IEEE
14 years 7 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
94
Voted
APDC
1997
14 years 11 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
DATE
2002
IEEE
95views Hardware» more  DATE 2002»
15 years 2 months ago
A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem
Abstract—Antenna problem is a phenomenon of plasma-induced gateoxide degradation. It directly affects manufacturability of very large scale integration (VLSI) circuits, especiall...
Li-Da Huang, Xiaoping Tang, Hua Xiang, D. F. Wong,...
WEBI
2009
Springer
15 years 4 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
CVPR
2010
IEEE
14 years 8 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt