1951 search results - page 110 / 391 » An algorithm for improving graph partitions |
141
click to vote
FLAIRS
2007
15 years 6 months ago
2007
We propose a method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline....
141
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
157
click to vote
JMLR
2012
13 years 7 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
120
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
137
click to vote
IMCSIT
2010
14 years 11 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...