Sciweavers

1957 search results - page 96 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
15 years 2 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
ER
2003
Springer
119views Database» more  ER 2003»
15 years 3 months ago
Toward the Automatic Derivation of XML Transformations
Existing solutions to data and schema integration require user interaction/input to generate a data transformation between two different schemas. These approaches are not appropri...
Martin Erwig
INFOCOM
2003
IEEE
15 years 3 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
COLING
2008
14 years 11 months ago
A Framework for Identifying Textual Redundancy
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
Kapil Thadani, Kathleen McKeown
AAAI
2011
13 years 9 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis