Sciweavers

1529 search results - page 44 / 306
» A slant removal algorithm
Sort
View
UAI
2004
14 years 11 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
14 years 9 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
CAD
1998
Springer
14 years 9 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
TIT
2002
54views more  TIT 2002»
14 years 9 months ago
Joint message-passing decoding of LDPC Codes and partial-response channels
Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based paralle...
Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf
ICWSM
2010
14 years 8 months ago
Coping With Noise in a Real-World Weblog Crawler and Retrieval System
In this paper we examine the effects of noise when creating a real-world weblog corpus for information retrieval. We focus on the DiffPost (Lee et al. 2008) approach to noise remo...
James Lanagan, Paul Ferguson, Neil O'Hare, Alan F....