Sciweavers

4539 search results - page 515 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ACSC
2005
IEEE
16 years 11 days ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 10 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
INFORMS
1998
150views more  INFORMS 1998»
15 years 6 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CVPR
2009
IEEE
17 years 1 months ago
Unsupervised Learning of Hierarchical Spatial Structures In Images
The visual world demonstrates organized spatial patterns, among objects or regions in a scene, object-parts in an object, and low-level features in object-parts. These classes o...
Devi Parikh (Carnegie Mellon University), C. Lawre...