Sciweavers

847 search results - page 10 / 170
» Approximation algorithms for projective clustering
Sort
View
DAC
1998
ACM
13 years 11 months ago
Approximate Reachability with BDDs Using Overlapping Projections
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
Shankar G. Govindaraju, David L. Dill, Alan J. Hu,...
JDA
2008
101views more  JDA 2008»
13 years 7 months ago
Student-Project Allocation with preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David Manlove, Gregg O'Malley
CAGD
1999
101views more  CAGD 1999»
13 years 7 months ago
Approximation algorithms for developable surfaces
By its dual representation, a developable surface can be viewed as a curve of dual projective 3-space. After introducing an appropriate metric in the dual space and restricting ou...
Helmut Pottmann, Johannes Wallner