Sciweavers

2383 search results - page 44 / 477
» Finding Representative Set from Massive Data
Sort
View
AIPR
2006
IEEE
15 years 4 months ago
Data Fusion, De-noising, and Filtering to Produce Cloud-Free High Quality Temporal Composites Employing Parallel Temporal Map Al
Remotely sensed images from satellite sensors such as MODIS Aqua and Terra provide high temporal resolution and wide area coverage. Unfortunately, these images frequently include ...
Bijay Shrestha, Charles G. O'Hara, Preeti Mali
JAIR
2008
173views more  JAIR 2008»
14 years 10 months ago
Creating Relational Data from Unstructured and Ungrammatical Data Sources
In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...
Matthew Michelson, Craig A. Knoblock
CANDC
2005
ACM
14 years 9 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 10 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
ICML
2010
IEEE
14 years 11 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu