Sciweavers

943 search results - page 72 / 189
» How should data structures and algorithms be taught
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
15 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
DEXA
2010
Springer
230views Database» more  DEXA 2010»
14 years 7 months ago
Hybrid Indexing and Seamless Ranking of Spatial and Textual Features of Web Documents
Abstract. There is a significant commercial and research interest in locationbased web search engines. Given a number of search keywords and one or more locations that a user is in...
Ali Khodaei, Cyrus Shahabi, Chen Li
BMCBI
2010
129views more  BMCBI 2010»
14 years 10 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
ICANN
2010
Springer
14 years 10 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora