Sciweavers

86 search results - page 11 / 18
» A Theory of Indirection via Approximation
Sort
View
AAAI
2010
13 years 8 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
IWFM
2000
112views Formal Methods» more  IWFM 2000»
13 years 8 months ago
A Note on the Relationships Between Logic Programs and Neural Networks
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
Pascal Hitzler, Anthony Karel Seda
TSD
2007
Springer
14 years 1 months ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
TMI
2008
85views more  TMI 2008»
13 years 6 months ago
Sparsity-Enforced Slice-Selective MRI RF Excitation Pulse Design
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
Adam C. Zelinski, Lawrence L. Wald, K. Setsompop, ...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau