Sciweavers

5668 search results - page 231 / 1134
» Overlaps in Requirements Engineering
Sort
View
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 8 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
3DIM
2007
IEEE
16 years 27 days ago
Predetermination of ICP Registration Errors And Its Application to View Planning
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
Kok-Lim Low, Anselmo Lastra
GLVLSI
2007
IEEE
106views VLSI» more  GLVLSI 2007»
16 years 27 days ago
Floorplan repair using dynamic whitespace management
We describe an efficient, top-down strategy for overlap removal and floorplan repair which repairs overlaps in floorplans produced by placement algorithms or rough floorplanni...
Kristofer Vorwerk, Andrew A. Kennings, Doris T. Ch...
IPPS
2006
IEEE
16 years 17 days ago
Anticipated distributed task scheduling for grid environments
Heterogeneous distributed environments or grid environments provide large computing resources for the execution of large scientific applications. The effective use of those plat...
Thomas Rauber, Gudula Rünger
BIRTHDAY
2005
Springer
16 years 3 days ago
Reduction Strategies for Left-Linear Term Rewriting Systems
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
Yoshihito Toyama