Sciweavers

522 search results - page 27 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
AAAI
1997
13 years 9 months ago
Variable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
Alex S. Fukunaga
SEC
2000
13 years 9 months ago
Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses
The theory of computer viruses has been studied by several authors, though there is no systematic theoretical study up to now. The long time open question in this area is as follo...
Yongge Wang
EUROGRAPHICS
2010
Eurographics
13 years 9 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 8 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
DAM
2008
145views more  DAM 2008»
13 years 8 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug