Sciweavers

4488 search results - page 321 / 898
» Properties of NP-Complete Sets
Sort
View
ICFP
1999
ACM
15 years 11 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
VISUALIZATION
1997
IEEE
15 years 11 months ago
Efficient subdivision of finite-element datasets into consistent tetrahedra
This paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while ...
Guy Albertelli, Roger Crawfis
CVPR
1996
IEEE
15 years 11 months ago
Connectionist networks for feature indexing and object recognition
Feature indexing techniques are promising for object recognition since they can quickly reduce the set of possible matches for a set of image features. This work exploits another ...
Clark F. Olson
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
15 years 11 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...
200
Voted
ICC
2007
IEEE
254views Communications» more  ICC 2007»
15 years 10 months ago
Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks
Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory...
Yong Wang, Byrav Ramamurthy