Sciweavers

2740 search results - page 92 / 548
» Approximating Component Selection
Sort
View
AAAI
2010
14 years 11 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
VMV
2003
154views Visualization» more  VMV 2003»
14 years 11 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
ANCS
2010
ACM
14 years 7 months ago
A traffic-aware top-N firewall ruleset approximation algorithm
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
Ho-Yu Lam, Donghan (Jarod) Wang, H. Jonathan Chao
LPNMR
2011
Springer
14 years 24 days ago
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
Thomas Eiter, Michael Fink, Peter Schüller
ICANN
2007
Springer
15 years 4 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka