Sciweavers

1104 search results - page 118 / 221
» Experimental evaluation of optimal CSMA
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ICPR
2006
IEEE
14 years 11 months ago
Boosted Band Ratio Feature Selection for Hyperspectral Image Classification
Band ratios have many useful applications in hyperspectral image analysis. While optimal ratios have been chosen empirically in previous research, we propose a principled algorith...
Antonio Robles-Kelly, Nianjun Liu, Terry Caelli, Z...
DAC
2001
ACM
14 years 11 months ago
Battery-Aware Static Scheduling for Distributed Real-Time Embedded Systems
This paper addresses battery-aware static scheduling in batterypowered distributed real-time embedded systems. As suggested by previous work, reducing the discharge current level ...
Jiong Luo, Niraj K. Jha
ICML
2004
IEEE
14 years 11 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
SIGSOFT
2008
ACM
14 years 11 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky