Sciweavers

387 search results - page 76 / 78
» Reasoning About Approximate Match Query Results
Sort
View
ASE
2004
137views more  ASE 2004»
13 years 7 months ago
Automatically Restructuring Programs for the Web
The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming...
Jacob Matthews, Robert Bruce Findler, Paul T. Grau...
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
SPAA
2003
ACM
14 years 21 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
AAAI
2012
11 years 9 months ago
Strategic Advice Provision in Repeated Human-Agent Interactions
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
Amos Azaria, Zinovi Rabinovich, Sarit Kraus, Claud...
WWW
2011
ACM
13 years 2 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...