681 search results - page 120 / 137 » General Polynomial Time Decomposition Algorithms |
ALGORITHMICA
1999
14 years 11 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
TPDS
2010
14 years 10 months ago
2010
— In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing...
104
click to vote
WWW
2008
ACM
16 years 12 days ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
113
click to vote
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
128
click to vote
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...