Sciweavers

4342 search results - page 536 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 11 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CVGIP
2004
175views more  CVGIP 2004»
15 years 6 months ago
A subdivision-based deformable model for surface reconstruction of unknown topology
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
Ye Duan, Hong Qin
IPL
2010
114views more  IPL 2010»
15 years 5 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
PPDP
2010
Springer
15 years 4 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 10 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache