Sciweavers

279 search results - page 47 / 56
» A Simple and Efficient Rectification Method for General Moti...
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
JAVA
2001
Springer
13 years 12 months ago
Supporting dynamic parallel object arrays
We present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An indi...
Orion Sky Lawlor, Laxmikant V. Kalé
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
13 years 11 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
EMSOFT
2006
Springer
13 years 11 months ago
Scheduling for multi-threaded real-time programs via path planning
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
Thao Dang, Philippe Gerner
GRAPHICSINTERFACE
2001
13 years 8 months ago
Novel Solver for Dynamic Surfaces
Physics-based modeling integrates dynamics and geometry. The standard methods to solve the Lagrangian equations use a direct approach in the spatial domain. Though extremely power...
Sumantro Ray, Hong Qin