Sciweavers

32545 search results - page 334 / 6509
» Data Structures and Algorithms
Sort
View
SIGCSE
2000
ACM
169views Education» more  SIGCSE 2000»
15 years 11 months ago
Design patterns for lazy evaluation
We propose an object-oriented (OO) formulation and implementation of lazy/delayed evaluation by reusing and extending an existing linear recursive structure (LRS) framework with t...
Dung Zung Nguyen, Stephen B. Wong
CSL
2010
Springer
15 years 7 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 7 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
IPL
2008
172views more  IPL 2008»
15 years 6 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler
FCSC
2007
130views more  FCSC 2007»
15 years 6 months ago
An improved algorithm for finding community structure in networks with an application to IPv6 backbone network
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
Yingxin Guo, Ke Xu