Sciweavers

520 search results - page 4 / 104
» Reductions Between Expansion Problems
Sort
View
AI
1998
Springer
13 years 11 months ago
Temporally Invariant Junction Tree for Inference in Dynamic Bayesian Network
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
Yang Xiang
AVI
2008
13 years 10 months ago
Starburst: a target expansion algorithm for non-uniform target distributions
Acquiring small targets on a tablet or touch screen can be challenging. To address the problem, researchers have proposed techniques that enlarge the effective size of targets by ...
Patrick Baudisch, Alexander Zotov, Edward Cutrell,...
SCL
2010
97views more  SCL 2010»
13 years 6 months ago
Krylov subspace methods for model order reduction of bilinear control systems
We discuss the use of Krylov subspace methods with regard to the problem of model order reduction. The focus lies on bilinear control systems, a special class of nonlinear systems...
Tobias Breiten, Tobias Damm
ISPD
2000
ACM
131views Hardware» more  ISPD 2000»
13 years 12 months ago
Multi-center congestion estimation and minimization during placement
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
Maogang Wang, Xiaojian Yang, Kenneth Eguro, Majid ...
CI
2007
124views more  CI 2007»
13 years 7 months ago
Searching for Explanatory Web Pages Using Automatic Query Expansion
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
Manabu Tauchi, Nigel Ward