Sciweavers

4137 search results - page 601 / 828
» On the number of matchings of a tree
Sort
View
DAC
2005
ACM
14 years 9 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
MICCAI
2003
Springer
14 years 9 months ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...
ICML
2005
IEEE
14 years 9 months ago
Large scale genomic sequence SVM classifiers
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...
Bernhard Schölkopf, Gunnar Rätsch, S&oum...
WWW
2006
ACM
14 years 9 months ago
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
Shumeet Baluja
ESORICS
2009
Springer
14 years 8 months ago
WORM-SEAL: Trustworthy Data Retention and Verification for Regulatory Compliance
Abstract. As the number and scope of government regulations and rules mandating trustworthy retention of data keep growing, businesses today are facing a higher degree of regulatio...
Tiancheng Li, Xiaonan Ma, Ninghui Li