Sciweavers

2233 search results - page 128 / 447
» On the Complexity of Theory Curbing
Sort
View
ACL
1998
15 years 7 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
AI
2008
Springer
15 years 5 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
INFOCOM
2010
IEEE
15 years 4 months ago
Compressive Sensing Based Positioning Using RSS of WLAN Access Points
Abstract— The sparse nature of location finding problem makes the theory of compressive sensing desirable for indoor positioning in Wireless Local Area Networks (WLANs). In this...
Chen Feng, Wain Sy Anthea Au, Shahrokh Valaee, Zhe...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
ATAL
2010
Springer
15 years 7 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson