3656 search results - page 401 / 732 » Compact Location Problems |
162
click to vote
APWEB
2007
Springer
16 years 26 days ago
2007
Springer
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and groupi...
161
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper proposes a novel handwriting recognition interface for wearable computing where users write characters continuously without pauses on a small single writing box. Since ...
148
Voted
SRDS
2003
IEEE
15 years 12 months ago
2003
IEEE
In today’s systems, applications are composed from various components that may be located on different machines. The components (acting as servers) may have to collaborate in or...
138
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
210
click to vote
SUTC
2010
IEEE
15 years 10 months ago
2010
IEEE
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...