Sciweavers

34 search results - page 7 / 7
» Dependency Pairs and Polynomial Path Orders
Sort
View
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 14 days ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
JOC
2006
69views more  JOC 2006»
13 years 6 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 9 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
ICALP
2009
Springer
14 years 6 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh