Sciweavers

5244 search results - page 38 / 1049
» When are two algorithms the same
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 11 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
ICEIS
2003
IEEE
14 years 29 days ago
Data Position and Profiling in Domain-Independent Warehouse Cleaning
: A major problem that arises from integrating different databases is the existence of duplicates. Data cleaning is the process for identifying two or more records within the datab...
Christie I. Ezeife, Ajumobi Udechukwu
ISCA
1998
IEEE
151views Hardware» more  ISCA 1998»
13 years 12 months ago
Alternative Implementations of Two-Level Adaptive Branch Prediction
As the issue rate and depth of pipelining of high performance Superscalar processors increase, the importance of an excellent branch predictor becomes more vital to delivering the...
Tse-Yu Yeh, Yale N. Patt
CGF
2006
191views more  CGF 2006»
13 years 7 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
WDAG
1999
Springer
88views Algorithms» more  WDAG 1999»
13 years 12 months ago
Generic Broadcast
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
Fernando Pedone, André Schiper