Sciweavers

272 search results - page 42 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
HT
1991
ACM
14 years 1 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
CVPR
2010
IEEE
14 years 6 months ago
A Diffusion Approach to Seeded Image Segmentation
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 3 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
AHS
2007
IEEE
211views Hardware» more  AHS 2007»
14 years 1 months ago
Synthesis of Multimode digital signal processing systems
In this paper, we propose a design methodology for implementing a multimode (or multi-configuration) and multi-throughput system into a single hardware architecture. The inputs of...
Caaliph Andriamisaina, Emmanuel Casseau, Philippe ...
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
13 years 10 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone