Sciweavers

953 search results - page 17 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 2 months ago
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Jakob Hoydis, Mérouane Debbah, Mari Kobayas...
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
14 years 9 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
IJCAI
1989
13 years 9 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications su...
Malik Ghallab, A. Mounir Alaoui
COLING
1990
13 years 9 months ago
Efficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
David M. Carter