10289 search results - page 30 / 2058 » Standard bases in K |
144
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
167
click to vote
AAIM
2009
Springer
16 years 21 days ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
166
click to vote
JCIT
2008
15 years 6 months ago
2008
Automatic speech recognition by machine is one of the most efficient methods for man-machine communications. Because speech waveform is nonlinear and variant. Speech recognition r...
144
click to vote
ECML
2005
Springer
15 years 11 months ago
2005
Springer
This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k,l)-contextual tree languages. It also introduces a method to...
129
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...