3656 search results - page 528 / 732 » Compact Location Problems |
190
click to vote
BIBE
2005
IEEE
16 years 3 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
192
click to vote
DSMML
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In recent years the problem of object recognition has received considerable attention from both the machine learning and computer vision communities. The key challenge of...
160
click to vote
CIAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
243
click to vote
SIGCOMM
1998
ACM
15 years 10 months ago
1998
ACM
Several recent proposals for an “active networks” architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range...
196
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...