Sciweavers

801 search results - page 135 / 161
» Minimal Locked Trees
Sort
View
NIPS
2004
14 years 11 months ago
Result Analysis of the NIPS 2003 Feature Selection Challenge
The NIPS 2003 workshops included a feature selection competition organized by the authors. We provided participants with five datasets from different application domains and calle...
Isabelle Guyon, Steve R. Gunn, Asa Ben-Hur, Gideon...
ISLPED
2010
ACM
193views Hardware» more  ISLPED 2010»
14 years 10 months ago
PASAP: power aware structured ASIC placement
Structured ASICs provide an exciting middle ground between FPGA and ASIC design methodologies. Compared to ASIC, structured ASIC based designs require lower non recurring engineer...
Ashutosh Chakraborty, David Z. Pan
CG
2008
Springer
14 years 9 months ago
Parallel reflective symmetry transformation for volume data
Many volume data possess symmetric features that can be clearly observed, for example, those existing in diffusion tensor image data sets. The exploitations of symmetries for volu...
Yuan Hong, Han-Wei Shen
DKE
2008
96views more  DKE 2008»
14 years 9 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
CN
2006
145views more  CN 2006»
14 years 9 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...