Sciweavers

7379 search results - page 1372 / 1476
» How Many Clusters
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 3 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 3 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICA3PP
2010
Springer
14 years 3 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
ICS
2010
Tsinghua U.
14 years 3 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 3 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
« Prev « First page 1372 / 1476 Last » Next »