3656 search results - page 398 / 732 » Compact Location Problems |
204
click to vote
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
188
click to vote
TC
2011
15 years 1 months ago
2011
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
211
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
324
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
206
click to vote
EWSN
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, thr...