Sciweavers

2434 search results - page 250 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
15 years 9 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
130
Voted
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 5 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
IDA
2007
Springer
15 years 4 months ago
Anomaly detection in data represented as graphs
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
William Eberle, Lawrence B. Holder
TSP
2008
90views more  TSP 2008»
15 years 4 months ago
Array-Based QR-RLS Multichannel Lattice Filtering
An array-based algorithm for multichannel lattice filtering is proposed. The filter is formed by a set of units that are adapted locally and concurrently using recursions that clos...
J. Gomes, V. A. N. Barroso
PAKDD
2010
ACM
146views Data Mining» more  PAKDD 2010»
15 years 9 months ago
Mining Antagonistic Communities from Social Networks
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with ...
Kuan Zhang, David Lo, Ee-Peng Lim