Sciweavers

5606 search results - page 974 / 1122
» Randomization Techniques for Graphs.
Sort
View
JCSS
2000
121views more  JCSS 2000»
15 years 6 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
ICWSM
2009
15 years 4 months ago
Targeting Sentiment Expressions through Supervised Ranking of Linguistic Configurations
User generated content is extremely valuable for mining market intelligence because it is unsolicited. We study the problem of analyzing users' sentiment and opinion in their...
Jason S. Kessler, Nicolas Nicolov
BMCBI
2010
201views more  BMCBI 2010»
15 years 3 months ago
IntelliGO: a new vector-based semantic similarity measure including annotation origin
Background: The Gene Ontology (GO) is a well known controlled vocabulary describing the biological process, molecular function and cellular component aspects of gene annotation. I...
Sidahmed Benabderrahmane, Malika Smaïl-Tabbon...
WWW
2011
ACM
15 years 1 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
NHM
2010
87views more  NHM 2010»
15 years 1 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...