Sciweavers

923 search results - page 118 / 185
» An Improved Evaluation Function for the Bandwidth Minimizati...
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 2 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 7 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
IPPS
1998
IEEE
13 years 12 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad