363 search results - page 70 / 73 » Finding Small Solutions to Small Degree Polynomials |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
IRI
2009
IEEE
14 years 2 months ago
2009
IEEE
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...
INTERACTION
2009
ACM
14 years 2 months ago
2009
ACM
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...