Sciweavers

536 search results - page 10 / 108
» Efficient Search Using Bitboard Models
Sort
View
EMNLP
2010
13 years 5 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
ICWS
2008
IEEE
13 years 9 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 7 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
ASC
2006
13 years 9 months ago
Simulation-based optimisation using local search and neural network metamodels
This paper presents a new algorithm for enhancing the efficiency of simulation-based optimisation using local search and neural network metamodels. The local search strategy is ba...
Anna Persson, Henrik Grimm, Amos Ng
ICML
1994
IEEE
13 years 11 months ago
Efficient Algorithms for Minimizing Cross Validation Error
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
Andrew W. Moore, Mary S. Lee