Sciweavers

34 search results - page 6 / 7
» Minimum dilation stars
Sort
View
ICALP
2004
Springer
14 years 3 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
SPIEVIP
2010
13 years 8 months ago
Ship detection in satellite imagery using rank-order grayscale hit-or-miss transforms
Ship detection from satellite imagery is something that has great utility in various communities. Knowing where ships are and their types provides useful intelligence information....
Neal R. Harvey, Reid B. Porter, James Theiler
ASPDAC
2007
ACM
87views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Topology exploration for energy efficient intra-tile communication
With technology nodes scaling down, the energy consumed by the on-chip intra-tile interconnects is beginning to have a significant impact on the total chip energy. The Energyoptima...
Jin Guo, Antonis Papanikolaou, Francky Catthoor
ENDM
2002
74views more  ENDM 2002»
13 years 9 months ago
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
Wayne Goddard, Michael A. Henning
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
14 years 1 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev