Sciweavers

17329 search results - page 172 / 3466
» Improved non-approximability results
Sort
View
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
14 years 10 months ago
Improved Approach for Noise Propagation to Identify Functional Noise Violations
This paper targets at reducing the crosstalk noise closure time by filtering the set of false violations. We propose two approaches to reduce the pessimism in the crosstalk noise ...
Sachin Shrivastava, Dhanoop Varghese, Vikas Narang...
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
14 years 9 months ago
Credibility-enhanced Curated Database: Improving the Value of Curated Databases
Abstract--In curated databases, annotations may contain opinions different from those in sources. Moreover, annotations may contradict each other and have uncertainty. Such situati...
Qun Ni, Elisa Bertino
IAT
2009
IEEE
14 years 4 months ago
Improving Collaborations in Neuroscientist Community
In this paper, we present a new approach, called SATIS (Semantically AnnotaTed Intentions for Services), relying on semantic web technologies and models, to assist collaboration a...
Isabelle Mirbel, Pierre Crescenzo
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 4 months ago
Improved inverse-depth parameterization for monocular simultaneous localization and mapping
— Inverse-depth parameterization can successfully deal with the feature initialization problem in monocular simultaneous localization and mapping applications. However, it is red...
Evren Imre, Marie-Odile Berger, Nicolas Noury
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
14 years 4 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich