Sciweavers

19320 search results - page 3439 / 3864
» On the complexity of computing determinants
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
EVOW
2009
Springer
15 years 10 months ago
Efficient Signal Processing and Anomaly Detection in Wireless Sensor Networks
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...
Markus Wälchli, Torsten Braun
ICC
2007
IEEE
229views Communications» more  ICC 2007»
15 years 10 months ago
A Cross-Layer Design on the Basis of Multiple Packet Reception in Asynchronous Wireless Network
This paper concerns the cross-layer design between physical layer and MAC (Multiple Access Control) layer in asynchronous wireless random access network. The proposed cross-layer d...
Anxin Li, Mingshu Wang, Xiangming Li, Hidetoshi Ka...
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
15 years 10 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
« Prev « First page 3439 / 3864 Last » Next »