Sciweavers

198 search results - page 24 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
COMPGEOM
2010
ACM
14 years 23 days ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
ICDE
2004
IEEE
99views Database» more  ICDE 2004»
14 years 9 months ago
Proving Ownership over Categorical Data
This paper introduces a novel method of rights protection for categorical data through watermarking. We discover new watermark embedding channels for relational data with categori...
Radu Sion
DAC
2007
ACM
14 years 9 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ICML
2009
IEEE
14 years 9 months ago
On primal and dual sparsity of Markov networks
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
Jun Zhu, Eric P. Xing
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
14 years 5 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm