1186 search results - page 176 / 238 » Improving Random Walk Performance |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
CIKM
2008
Springer
13 years 12 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
UAI
2004
13 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
WCE
2007
13 years 11 months ago
2007
— This paper proposes an age artificial immune system (AAIS), for optimal order pickings in an Automated Storage and Retrieval System (AS/RS) with multiple input/ output stations...