2137 search results - page 373 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
101
Voted
AAAI
2006
15 years 3 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
137
Voted
NIPS
2001
15 years 3 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
113
click to vote
MOBIHOC
2003
ACM
16 years 1 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
123
click to vote
PAISI
2009
Springer
15 years 9 months ago
2009
Springer
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
127
click to vote
CIAC
2000
Springer
15 years 6 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...