Sciweavers

1998 search results - page 301 / 400
» Complexity of the Cover Polynomial
Sort
View
101
Voted
TMC
2010
152views more  TMC 2010»
14 years 11 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici
106
Voted
BMVC
2010
14 years 10 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann
90
Voted
CASES
2010
ACM
14 years 10 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
95
Voted
DLOG
2010
14 years 10 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
109
Voted
ER
2010
Springer
132views Database» more  ER 2010»
14 years 10 months ago
Full Satisfiability of UML Class Diagrams
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...