3146 search results - page 180 / 630 » Efficient Consequence Finding |
139
click to vote
SWAT
1998
Springer
15 years 10 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
170
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
153
Voted
KAIS
2000
15 years 5 months ago
2000
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
266
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
208
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...