Sciweavers

284 search results - page 48 / 57
» What Matchings Can Be Stable
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
RIAO
2004
13 years 11 months ago
Improving Ontology-Based User Profiles
Personalized Web browsing and search hope to provide Web information that matches a user's personal interests and thus provide more effective and efficient information access...
Joana Trajkova, Susan Gauch
BMCBI
2008
153views more  BMCBI 2008»
13 years 9 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
BMCBI
2008
137views more  BMCBI 2008»
13 years 9 months ago
Evading the annotation bottleneck: using sequence similarity to search non-sequence gene data
Background: Non-sequence gene data (images, literature, etc.) can be found in many different public databases. Access to these data is mostly by text based methods using gene name...
Michael J. Gilchrist, Mikkel B. Christensen, Richa...
DOCENG
2010
ACM
13 years 10 months ago
Contextual advertising for web article printing
: Contextual Advertising for Web Article Printing Shengwen Yang, Jianming Jin, Parag Joshi, Sam Liu HP Laboratories HPL-2010-79 printed ad, web printing, article extraction, conte...
Shengwen Yang, Jianming Jin, Joshi Parag, Sam Liu