Sciweavers

301 search results - page 37 / 61
» Kronecker Graphs: An Approach to Modeling Networks
Sort
View
DAC
1999
ACM
14 years 29 days ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...
CICLING
2009
Springer
13 years 6 months ago
NLP for Shallow Question Answering of Legal Documents Using Graphs
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
Alfredo Monroy, Hiram Calvo, Alexander F. Gelbukh
TVCG
2008
100views more  TVCG 2008»
13 years 8 months ago
Two-Character Motion Analysis and Synthesis
In this paper, we deal with the problem of synthesizing novel motions of standing-up martial arts such as Kickboxing, Karate, and Taekwondo performed by a pair of humanlike charact...
Taesoo Kwon, Young-Sang Cho, Sang Il Park, Sung Yo...
PASTE
2010
ACM
14 years 1 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner