Sciweavers

350 search results - page 7 / 70
» Hardness Results for Homology Localization
Sort
View
CHI
2010
ACM
13 years 5 months ago
Trying too hard: effects of mobile agents' (Inappropriate) social expressiveness on trust, affect and compliance
Mobile services can provide users with information relevant to their current circumstances. Distant services in turn can acquire local information from people in an area of intere...
Henriette S. M. Cramer, Vanessa Evers, Tim van Slo...
IMSCCS
2006
IEEE
14 years 1 months ago
GenomeBlast: A Web Tool for Small Genome Comparison
Comparative genomics has become an essential approach for identifying homologous gene candidates and their functions, and for studying genome evolution. We developed GenomeBlast, ...
Guoqing Lu, Liying Jiang, Resa M. Kotalik, Thaine ...
ICCV
2011
IEEE
12 years 7 months ago
Robust Topological Features for Deformation Invariant Image Matching
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 7 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans