Sciweavers

32545 search results - page 704 / 6509
» Data Structures and Algorithms
Sort
View
ADG
2006
Springer
204views Mathematics» more  ADG 2006»
16 years 1 months ago
Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...
Robert H. Lewis, Evangelos A. Coutsias
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 8 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
ICMLA
2010
15 years 5 months ago
Heuristic Method for Discriminative Structure Learning of Markov Logic Networks
Markov Logic Networks (MLNs) combine Markov Networks and first-order logic by attaching weights to firstorder formulas and viewing them as templates for features of Markov Networks...
Quang-Thang Dinh, Matthieu Exbrayat, Christel Vrai...
CVPR
2008
IEEE
16 years 9 months ago
Context-aware clustering
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
Junsong Yuan, Ying Wu
LCPC
2007
Springer
16 years 1 months ago
Communicating Multiprocessor-Tasks
The use of multiprocessor tasks (M-tasks) has been shown to be successful for mixed task and data parallel implementations of algorithms from scientific computing. The approach o...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...