2503 search results - page 110 / 501 » A study of 3-arc graphs |
170
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
161
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
164
click to vote
COCO
2009
Springer
16 years 22 days ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
133
click to vote
MFCS
2009
Springer
16 years 21 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
152
click to vote
DSD
2007
IEEE
16 years 15 days ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...