91 search results - page 7 / 19 » Information-theoretic approaches to branching in search |
HICSS
2010
IEEE
14 years 3 months ago
2010
IEEE
Geographic information retrieval (GIR) is, as a branch of traditional information retrieval, a discipline that tries to enrich data with geographical information to make it suitab...
COLOGNETWENTE
2010
13 years 5 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
COR
2010
13 years 8 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
SCALESPACE
1999
Springer
14 years 24 days ago
1999
Springer
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
ISCAS
2008
IEEE
14 years 2 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...