3875 search results - page 533 / 775 » Approximation algorithms for the 0-extension problem |
162
Voted
PSB
2004
15 years 8 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
182
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
187
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
175
click to vote
WIDM
2006
ACM
16 years 17 days ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
176
click to vote
APSCC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...