Sciweavers

702 search results - page 78 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 7 days ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
CGF
2008
151views more  CGF 2008»
14 years 11 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
AI
2007
Springer
15 years 2 hour ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
3DPVT
2006
IEEE
170views Visualization» more  3DPVT 2006»
15 years 6 months ago
Minimum Spanning Tree Pose Estimation
The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter ...
Kevin L. Steele, Parris K. Egbert
ICCV
1999
IEEE
16 years 1 months ago
Segmentation of Salient Closed Contours from Real Images
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...