Sciweavers

8413 search results - page 1516 / 1683
» Ordering Problem Subgoals
Sort
View
TCAD
1998
86views more  TCAD 1998»
15 years 3 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 3 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
TCSV
2002
132views more  TCSV 2002»
15 years 3 months ago
A study of real-time packet video quality using random neural networks
An important and unsolved problem today is the automatic quantification of the quality of video flows transmitted over packet networks. In particular, the ability to perform this ...
Samir Mohamed, Gerardo Rubino
NA
2007
147views more  NA 2007»
15 years 3 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
PVLDB
2008
99views more  PVLDB 2008»
15 years 3 months ago
Industry-scale duplicate detection
Duplicate detection is the process of identifying multiple representations of a same real-world object in a data source. Duplicate detection is a problem of critical importance in...
Melanie Weis, Felix Naumann, Ulrich Jehle, Jens Lu...
« Prev « First page 1516 / 1683 Last » Next »