1083 search results - page 67 / 217 » Efficient Discovery of Confounders in Large Data Sets |
162
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
288
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
152
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Recognition using appearance features is confounded by
phenomena that cause images of the same object to look different,
or images of different objects to look the same. This
ma...
163
click to vote
ICMCS
2009
IEEE
15 years 3 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
180
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...