Sciweavers

2509 search results - page 90 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
119
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
Counterexample Guided Path Reduction for Static Program Analysis
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
Ansgar Fehnker, Ralf Huuck, Sean Seefried
GLOBECOM
2007
IEEE
15 years 7 months ago
Position Estimation Error in Edge Detection for Wireless Sensor Networks using Local Convex View
Abstract—Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and application...
Marwan Fayed, Hussein T. Mouftah
DCOSS
2005
Springer
15 years 6 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
111
Voted
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 20 days ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
90
Voted
VC
2010
160views more  VC 2010»
14 years 11 months ago
A lightweight approach to repairing digitized polygon meshes
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Marco Attene