Sciweavers

104 search results - page 12 / 21
» Incomplete Tree Search using Adaptive Probing
Sort
View
AI
2006
Springer
13 years 7 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
SIGIR
2009
ACM
14 years 2 months ago
Temporal collaborative filtering with adaptive neighbourhoods
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...
Neal Lathia, Stephen Hailes, Licia Capra
EMNLP
2007
13 years 9 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
RECOMB
2012
Springer
11 years 10 months ago
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
Nurcan Tuncbag, Alfredo Braunstein, Andrea Pagnani...
TSP
2008
140views more  TSP 2008»
13 years 7 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick