Sciweavers

10608 search results - page 539 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ASPDAC
2001
ACM
82views Hardware» more  ASPDAC 2001»
15 years 10 months ago
A virtual 3-D multipole accelerated extractor for VLSI parasitic interconnect capacitance
A virtual 3-D extractor of the single dielectric is presented in this paper. In the indirect boundary integral equations, the plane charge distribution on the surface of conductors...
Zhaozhi Yang, Zeyi Wang, Shuzhou Fang
ACE
2004
258views Education» more  ACE 2004»
15 years 8 months ago
Using a Maze Case Study to Teach Object-Oriented Programming and Design Patterns
In order to teach object-oriented design and programming in introductory computer science it is imperative to teach objects from the very beginning of the course. The use of inter...
Chris Nevison, Barbara Wells
NIPS
2001
15 years 8 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
EJC
1998
15 years 6 months ago
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
Wilfried Imrich, Sandi Klavzar
ICASSP
2011
IEEE
14 years 10 months ago
New results on adaptive computational resource allocation in soft MIMO detection
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson