3656 search results - page 217 / 732 » Compact Location Problems |
121
Voted
IJON
2006
15 years 6 months ago
2006
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
148
click to vote
IPL
2010
15 years 4 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
233
click to vote
IPMI
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...
193
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and s...
152
Voted
ISCAS
2006
IEEE
16 years 11 days ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...