56 search results - page 8 / 12 » Constructing Verifiable Random Functions with Large Input Sp... |
SIGMOD
2010
ACM
14 years 13 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
MICRO
2006
IEEE
14 years 1 months ago
2006
IEEE
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...