Sciweavers

3946 search results - page 405 / 790
» The computational complexity of choice sets
Sort
View
MST
2010
140views more  MST 2010»
15 years 6 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
CVPR
2003
IEEE
16 years 9 months ago
A 2D Moving Grid Geometric Deformable Model
Geometric deformable models based on the level set method have become very popular in the last several years. To overcome an inherent limitation in accuracy while maintaining comp...
Xiao Han, Chenyang Xu, Jerry L. Prince
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
16 years 7 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
CIBCB
2008
IEEE
16 years 2 months ago
Very large scale ReliefF for genome-wide association analysis
— The genetic causes of many monogenic diseases have already been discovered. However, most common diseases are actually the result of complex nonlinear interactions between mult...
Margaret J. Eppstein, Paul Haake
BROADNETS
2007
IEEE
16 years 1 months ago
Modeling and analysis of worm interactions (war of the worms)
—“War of the worms” is a war between opposing computer worms, creating complex worm interactions as well as detrimental impact on infrastructure. For example, in September 20...
Sapon Tanachaiwiwat, Ahmed Helmy