10493 search results - page 1607 / 2099 » Dynamic Word Problems |
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
277
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
153
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem ...
146
click to vote
PODS
2002
ACM
16 years 4 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
107
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...