Sciweavers

13457 search results - page 96 / 2692
» Can we elect if we cannot compare
Sort
View
BMCBI
2004
143views more  BMCBI 2004»
13 years 8 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
CSE
2009
IEEE
14 years 3 months ago
Web Science 2.0: Identifying Trends through Semantic Social Network Analysis
—We introduce a novel set of social network analysis based algorithms for mining the Web, blogs, and online forums to identify trends and find the people launching these new tren...
Peter A. Gloor, Jonas Krauss, Stefan Nann, Kai Fis...
CCS
2004
ACM
14 years 2 months ago
Parallel mixing
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
Philippe Golle, Ari Juels
SIGECOM
2010
ACM
137views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Prediction without markets
Citing recent successes in forecasting elections, movies, products, and other outcomes, prediction market advocates call for widespread use of market-based methods for government ...
Sharad Goel, Daniel M. Reeves, Duncan J. Watts, Da...
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 3 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw