2374 search results - page 193 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
150
click to vote
HAPTICS
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
180
click to vote
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
158
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
175
Voted
EMMCVPR
2003
Springer
15 years 10 months ago
2003
Springer
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
182
click to vote
ICDE
2012
IEEE
13 years 7 months ago
2012
IEEE
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...