Sciweavers

253 search results - page 42 / 51
» Edge and Node Searching Problems on Trees
Sort
View
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 4 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 7 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
TIT
2008
112views more  TIT 2008»
13 years 7 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar