Sciweavers

1640 search results - page 150 / 328
» Conditional Independence Trees
Sort
View
DLOG
2007
15 years 4 months ago
On Ordering Descriptions in a Description Logic
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 3 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
IJCAI
2003
15 years 3 months ago
Evaluating Coverage for Large Symbolic NLG Grammars
After many successes, statistical approaches that have been popular in the parsing community are now making headway into Natural Language Generation (NLG). These systems are aimed...
Charles B. Callaway
AAAI
1996
15 years 3 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
125
Voted
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 2 months ago
Energy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
Animashree Anandkumar, Joseph E. Yukich, Lang Tong...