Sciweavers

246 search results - page 14 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 4 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
86
Voted
ICML
2008
IEEE
15 years 10 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
CGF
1999
125views more  CGF 1999»
14 years 9 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
SIGSOFT
2009
ACM
15 years 10 months ago
Improving bug triage with bug tossing graphs
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
Gaeul Jeong, Sunghun Kim, Thomas Zimmermann
69
Voted
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
14 years 11 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...