Sciweavers

4074 search results - page 194 / 815
» Abstract Graph Transformation
Sort
View
135
Voted
TCAD
2008
93views more  TCAD 2008»
15 years 2 months ago
Transforming Cyclic Circuits Into Acyclic Equivalents
Abstract--Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for certain combinational functions, cyclic circuits that are stable and d...
Osama Neiroukh, Stephen A. Edwards, Xiaoyu Song
FOCS
2005
IEEE
15 years 8 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
ICIAP
2009
ACM
16 years 3 months ago
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
Zachary A. Garrett, Hideo Saito
123
Voted
BIRTHDAY
2010
Springer
15 years 9 months ago
Extended Compact Web Graph Representations
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
Francisco Claude, Gonzalo Navarro
148
Voted
IWPEC
2009
Springer
15 years 9 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...