Sciweavers

319 search results - page 55 / 64
» Modeling the growth of future web
Sort
View
SOFSEM
2000
Springer
14 years 5 days ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
BMCBI
2008
102views more  BMCBI 2008»
13 years 8 months ago
Ornithine decarboxylase antizyme finder (OAF): Fast and reliable detection of antizymes with frameshifts in mRNAs
Background: Ornithine decarboxylase antizymes are proteins which negatively regulate cellular polyamine levels via their affects on polyamine synthesis and cellular uptake. In vir...
Michaël Bekaert, Ivaylo P. Ivanov, John F. At...
ICS
2010
Tsinghua U.
14 years 6 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
CIKM
2009
Springer
14 years 1 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
IJMMS
2006
94views more  IJMMS 2006»
13 years 8 months ago
A framework for understanding trust factors in web-based health advice
Trust is a key factor in consumer decisions about website engagement. Consumers will engage with sites they deem trustworthy and turn away from those they mistrust. In this paper ...
Elizabeth Sillence, Pamela Briggs, Peter Harris, L...