Sciweavers

5210 search results - page 857 / 1042
» Exact geometric computation
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 3 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
14 years 3 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
ICDS
2010
IEEE
14 years 3 months ago
Modeling and Analysis of Laws Using BPR and Goal-Oriented Framework
Abstract—Recently, two complementary approaches are proposed to represent, model and analyze laws: the Nomos and VLPM approaches. Nomos is a goal-oriented approach to effectively...
Adolfo Villafiorita, Komminist Weldemariam, Angelo...
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 3 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
SCCC
2003
IEEE
14 years 3 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes