5169 search results - page 261 / 1034 » Locality approximation using time |
156
Voted
ICDCS
2005
IEEE
16 years 7 days ago
2005
IEEE
The process of computing the physical locations of nodes in a wireless sensor network is known as localization. Selflocalization is critical for large-scale sensor networks becaus...
176
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
191
click to vote
ISBI
2007
IEEE
16 years 28 days ago
2007
IEEE
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
178
click to vote
IDA
2003
Springer
15 years 12 months ago
2003
Springer
The segmentation of time-series is a constrained clustering problem: the data points should be grouped by their similarity, but with the constraint that all points in a cluster mus...
203
click to vote
FOIKS
2004
Springer
16 years 15 hour ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...