Sciweavers

1458 search results - page 284 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 27 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
BMCBI
2007
142views more  BMCBI 2007»
13 years 7 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
IOR
2006
91views more  IOR 2006»
13 years 7 months ago
Robust One-Period Option Hedging
The paper considers robust optimization to cope with uncertainty about the stock return process in one period option hedging problems. The robust approach relates portfolio choice ...
Frank Lutgens, Jos F. Sturm, Antoon Kolen
BMCBI
2010
153views more  BMCBI 2010»
13 years 6 months ago
DiffCoEx: a simple and sensitive method to find differentially coexpressed gene modules
Background: Large microarray datasets have enabled gene regulation to be studied through coexpression analysis. While numerous methods have been developed for identifying differen...
Bruno M. Tesson, Rainer Breitling, Ritsert C. Jans...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 8 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma