3471 search results - page 357 / 695 » Obstacle Numbers of Graphs |
230
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
180
click to vote
CODES
2005
IEEE
16 years 12 days ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
234
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
186
click to vote
FPGA
1998
ACM
15 years 11 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
174
click to vote
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...