Sciweavers

5607 search results - page 761 / 1122
» Graph structure in the Web
Sort
View
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 10 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
AAECC
2006
Springer
122views Algorithms» more  AAECC 2006»
15 years 10 months ago
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
Shadi Abu-Surra, Gianluigi Liva, William E. Ryan
CP
2006
Springer
15 years 10 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
AFRIGRAPH
2001
ACM
15 years 10 months ago
Real time isosurface browsing
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
Caleb Lyness, Edwin H. Blake
178
Voted
EWHCI
1995
15 years 10 months ago
Generating Editors for Direct Manipulation of Diagrams
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
Gerhard Viehstaedt, Mark Minas