7930 search results - page 685 / 1586 » Greedy in Approximation Algorithms |
229
click to vote
SPEECH
2010
15 years 2 months ago
2010
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
176
click to vote
TIT
2010
15 years 2 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
210
Voted
SSD
2005
Springer
16 years 27 days ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
195
Voted
EMMCVPR
2001
Springer
15 years 12 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
235
Voted
ACIVS
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...