Sciweavers

2846 search results - page 19 / 570
» Believe it or Not
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 8 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
WWW
2011
ACM
13 years 4 months ago
Generalized fact-finding
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
Jeff Pasternack, Dan Roth
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 10 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
ALT
2001
Springer
14 years 6 months ago
Inventing Discovery Tools: Combining Information Visualization with Data Mining
The growing use of information visualization tools and data mining algorithms stems from two separate lines of research. Information visualization researchers believe in the impor...
Ben Shneiderman
CVPR
2010
IEEE
1248views Computer Vision» more  CVPR 2010»
14 years 6 months ago
Food Recognition Using Statistics of Pairwise Local Features
Food recognition is difficult because food items are deformable objects that exhibit significant variations in appearance. We believe the key to recognizing food is to exploit the...
Shulin Yang, Mei Chen, Dean Pomerleau, Rahul Sukth...