Sciweavers

5624 search results - page 147 / 1125
» On Conditional Covering Problem
Sort
View
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
16 years 15 days ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
COLING
2008
15 years 7 months ago
Detecting Multiple Facets of an Event using Graph-Based Unsupervised Methods
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
Pradeep Muthukrishnan, Joshua Gerrish, Dragomir R....
SIGDIAL
2010
15 years 4 months ago
A unified account of the semantics of discourse particles
The paper investigates discourse particles on the example of German doch, assigning to them very specific semantic interpretations that still cover a wide range of their uses. The...
Markus Egg
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 8 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
PDCN
2004
15 years 7 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...