Sciweavers

140 search results - page 28 / 28
» Computing the Edit-Distance between Unrooted Ordered Trees
Sort
View
BMCBI
2007
133views more  BMCBI 2007»
13 years 5 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
MOBIHOC
2003
ACM
14 years 4 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
BMCBI
2007
146views more  BMCBI 2007»
13 years 5 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...
COMCOM
2006
147views more  COMCOM 2006»
13 years 5 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
TALG
2008
131views more  TALG 2008»
13 years 5 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir