Sciweavers

220 search results - page 23 / 44
» ideal 2005
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 5 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
3DIM
2005
IEEE
14 years 4 months ago
Automatic Burr Detection on Surfaces of Revolution Based on Adaptive 3D Scanning
This paper describes how to automatically extract the presence and location of geometrical irregularities on a surface of revolution. To this end a partial 3D scan of the workpiec...
Kasper Claes, Thomas P. Koninckx, Herman Bruyninck...
APSEC
2005
IEEE
14 years 4 months ago
Automated Refactoring of Objects for Application Partitioning
Distributed infrastructures are becoming more and more diverse in nature. An application may often need to be redeployed in various scenarios. Ideally, given an application design...
Vikram Jamwal, Sridhar Iyer
CCGRID
2005
IEEE
14 years 4 months ago
ReGS: user-level reliability in a grid environment
Grid environments are ideal for executing applications that require a huge amount of computational work, both due to the big number of tasks to execute and to the large amount of ...
J. A. L. Sanches, Patrícia Kayser Vargas, I...
CIMCA
2005
IEEE
14 years 4 months ago
NEFCOP: A Neuro-Fuzzy Vehicle Collision Prediction System
Given that road accidents occur in a real-time environment, simple crisp functions would barely provide an estimate of the gravity of the life situation. Fuzzy-based systems are a...
K. Venkatesh, Archana Ramesh, M. Alagusundaram, J....