Sciweavers

1017 search results - page 27 / 204
» Some existence and construction results of polygonal designs
Sort
View
KES
2008
Springer
13 years 7 months ago
Ontology-Based Design Pattern Recognition
This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontolog...
Damir Kirasic, Danko Basch
COMGEO
2008
ACM
13 years 7 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
13 years 7 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg
ACMIDC
2009
13 years 11 months ago
Ten design lessons from the literature on child development and children's use of technology
The existing knowledge base on child development offers a wealth of information that can be useful for the design of children's technology. Furthermore, academic journals and...
Helene Gelderblom, Paula Kotzé
SBCCI
2003
ACM
160views VLSI» more  SBCCI 2003»
14 years 19 days ago
Novel Design Methodology for High-Performance XOR-XNOR Circuit Design
As we scale down to deep submicron (DSM) technology, noise is becoming a metric of equal importance as power, speed, and area. Smaller feature sizes, low voltage, and high frequen...
Sumeer Goel, Mohamed A. Elgamel, Magdy A. Bayoumi