Sciweavers

6300 search results - page 62 / 1260
» We have it easy, but do we have it right
Sort
View
ESWS
2008
Springer
15 years 3 months ago
Combining Context Navigation with Semantic Autocompletion to Solve Problems in Concept Selection
Many tasks on the semantic web require the user to choose concepts from a limited vocabulary e.g. for describing an indexed resource or for use in semantic search. Semantic autocom...
Reetta Sinkkilä, Eetu Mäkelä, Eero ...
CSE
2009
IEEE
15 years 8 months ago
Enabling Privacy as a Fundamental Construct for Social Networks
The current set of social networking platforms, e.g. Facebook and MySpace, has created a new class of Internet applications called social software. These systems focus on leveragi...
E. Michael Maximilien, Tyrone Grandison, Kun Liu, ...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 5 months ago
Ultralow-Power Reconfigurable Computing with Complementary Nano-Electromechanical Carbon Nanotube Switches
In recent years, several alternative devices have been proposed to deal with inherent limitation of conventional CMOS devices in terms of scalability at nanometer scale geometry. ...
Swarup Bhunia, Massood Tabib-Azar, Daniel G. Saab
APAL
1999
88views more  APAL 1999»
15 years 26 days ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting
ECCC
2008
168views more  ECCC 2008»
15 years 1 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson