418 search results - page 15 / 84 » Many Happy Returns |
SIGGRAPH
1993
ACM
13 years 10 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
TKDE
2010
13 years 5 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
TKDE
2012
11 years 9 months ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
ICDE
2009
IEEE
14 years 8 months ago
2009
IEEE
A large number of online databases are hidden behind form-like interfaces which allow users to execute search queries by specifying selection conditions in the interface. Most of t...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...