Sciweavers

935 search results - page 37 / 187
» Some Results on Orthogonal Factorizations
Sort
View
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
15 years 7 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
CHI
2008
ACM
15 years 10 months ago
Design of human-map system interaction
In this work-in-progress we present some ideas and findings involving map design and human performance. Satellites has once and for all automated geographic positioning and result...
Thomas Porathe, Johannes Prison
CADE
1998
Springer
15 years 2 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
VLSID
2003
IEEE
144views VLSI» more  VLSID 2003»
15 years 10 months ago
The Impact of Bit-Line Coupling and Ground Bounce on CMOS SRAM Performance
In this paper, we provide an analytical framework to study the inter-cell and intra-cell bit-line coupling when it is superimposed with the ground bounce effect and show how those...
Li Ding 0002, Pinaki Mazumder
JCP
2008
104views more  JCP 2008»
14 years 9 months ago
Trusted Decision Mechanism Based on Fuzzy Logic for Open Network
Trust mechanism will be an important trend in the field of security for open network. But, as an important factor risk is little considered in trust model. In this paper, Further w...
Lin Zhang, Ruchuan Wang, Haiyan Wang