Sciweavers

1814 search results - page 94 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
COMPGEOM
2004
ACM
15 years 11 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
CIDM
2009
IEEE
16 years 24 days ago
An improved multiple minimum support based approach to mine rare association rules
Abstract—In this paper we have proposed an improved approach to extract rare association rules. Rare association rules are the association rules containing rare items. Rare items...
R. Uday Kiran, P. Krishna Reddy