Sciweavers

5100 search results - page 677 / 1020
» The Linear Complexity of a Graph
Sort
View
IJFCS
1998
67views more  IJFCS 1998»
15 years 6 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
MMS
2007
15 years 6 months ago
Modeling user context with applications to media retrieval
In this paper, we develop a theoretical understanding of multi-sensory knowledge and user context and their interrelationships. This is used to develop a generic representation fr...
Ankur Mani, Hari Sundaram
ICPR
2010
IEEE
15 years 5 months ago
3D Vertebrae Segmentation in CT Images with Random Noises
Exposure levels (X-ray tube amperage and peak kilovoltage) are associated with various noise levels and radiation dose. When higher exposure levels are applied, the images have hi...
Melih Seref Aslan
ICASSP
2010
IEEE
15 years 5 months ago
A novel, fast, and complete 3D segmentation of vertebral bones
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
Melih S. Aslan, Asem M. Ali, Ham Rara, Ben Arnold,...
MP
2010
145views more  MP 2010»
15 years 5 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...