Sciweavers

55 search results - page 7 / 11
» Could there be exactly two things
Sort
View
INFOCOM
2002
IEEE
14 years 8 days ago
Topologically-Aware Overlay Construction and Server Selection
— A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host no...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...
ICDE
2009
IEEE
134views Database» more  ICDE 2009»
14 years 9 months ago
Non-Exposure Location Anonymity
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point with coordinates) and replaces it with a well-shape...
Haibo Hu, Jianliang Xu
AMEC
2003
Springer
14 years 18 days ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
DATESO
2007
157views Database» more  DATESO 2007»
13 years 8 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
FOCS
2007
IEEE
14 years 1 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider