Sciweavers

146 search results - page 25 / 30
» An Algorithm for Enumerating All Spanning Trees of a Directe...
Sort
View
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
14 years 2 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
IPPS
2005
IEEE
14 years 1 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...
CIKM
2007
Springer
14 years 1 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 11 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu