16430 search results - page 462 / 3286 » On Computable Tree Functions |
229
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
181
click to vote
ADHOCNOW
2007
Springer
16 years 1 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
175
click to vote
CIKM
2005
Springer
16 years 14 days ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
159
click to vote
DIS
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. Behavioral sequences of the medaka (Oryzias latipes) were continuously investigated through an automatic image recognition system in response to medaka treated with the i...
184
click to vote
ICALP
2003
Springer
16 years 4 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...