Sciweavers

8671 search results - page 1596 / 1735
» A generator for hierarchical problems
Sort
View
JAL
2006
114views more  JAL 2006»
13 years 8 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
CSL
2007
Springer
13 years 8 months ago
Accessing speech data using strategic fixation
When users access information from text, they engage in strategic fixation, visually scanning the text to focus on regions of interest. However, because speech is both serial and ...
Steve Whittaker, Julia Hirschberg
CVIU
2007
193views more  CVIU 2007»
13 years 8 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba
JSAT
2008
122views more  JSAT 2008»
13 years 8 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JGAA
2006
120views more  JGAA 2006»
13 years 8 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
« Prev « First page 1596 / 1735 Last » Next »