Sciweavers

6167 search results - page 268 / 1234
» Can Refinement be Automated
Sort
View
156
Voted
SGP
2007
15 years 9 months ago
Unconstrained isosurface extraction on arbitrary octrees
This paper presents a novel algorithm for generating a watertight level-set from an octree. We show that the levelset can be efficiently extracted regardless of the topology of th...
Michael M. Kazhdan, Allison Klein, Ketan Dalal, Hu...
198
Voted
UAI
1994
15 years 8 months ago
Global Conditioning for Probabilistic Inference in Belief Networks
In this paper we propose a new approach to probabilistic inference on belief networks, global conditioning, which is a simple generalization of Pearl's (1986b) method of loop...
Ross D. Shachter, Stig K. Andersen, Peter Szolovit...
NRHM
2002
87views more  NRHM 2002»
15 years 7 months ago
Denotative and connotative semantics in hypermedia: proposal for a semiotic-aware architecture
In this article we claim that the linguistic-centred view within hypermedia systems needs refinement through a semiotic-based approach before real interoperation between media can...
Frank Nack, Lynda Hardman
230
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 2 months ago
Probability Based Clustering for Document and User Properties
Information Retrieval systems can be improved by exploiting context information such as user and document features. This article presents a model based on overlapping probabilistic...
Thomas Mandl, Christa Womser-Hacker
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
16 years 4 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song