Sciweavers

1633 search results - page 159 / 327
» Planar Map Graphs
Sort
View
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 10 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
ICML
2009
IEEE
14 years 11 months ago
Multi-instance learning by treating instances as non-I.I.D. samples
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
Zhi-Hua Zhou, Yu-Yin Sun, Yu-Feng Li
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
14 years 3 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
DCG
2008
93views more  DCG 2008»
13 years 10 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
INFOCOM
2007
IEEE
14 years 5 months ago
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
Stefan Funke, Nikola Milosavljevic