6833 search results - page 98 / 1367 » Some two-character sets |
TROB
2010
14 years 10 months ago
2010
—We propose a novel framework, passive set-position modulation (PSPM), which enables us to connect a (continuoustime) robot’s position to a sequence of slowly-updating/sparse (...
EMNLP
2009
14 years 9 months ago
2009
One of the most desired information types when planning a trip to some place is the knowledge of transport, roads and geographical connectedness of prominent sites in this place. ...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
102
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
100
click to vote
COMSWARE
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...