Sciweavers

438 search results - page 77 / 88
» Open Data for Global Science
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 7 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
COMPGEOM
2004
ACM
13 years 11 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
CAD
2000
Springer
13 years 7 months ago
The Enterprise-Web portal for life-cycle support
As we enter the new millennium, the approach to product development is evolving rapidly. Companies are in the process of creating a distributed design and manufacturing environmen...
Mohsen Rezayat
SIGSOFT
2003
ACM
14 years 8 months ago
Tracking pointers with path and context sensitivity for bug detection in C programs
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
V. Benjamin Livshits, Monica S. Lam
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 11 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...