Sciweavers

176 search results - page 17 / 36
» Sorting and Selection with Random Costs
Sort
View
DEBU
2010
128views more  DEBU 2010»
13 years 5 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
JCM
2006
129views more  JCM 2006»
13 years 7 months ago
T-ANT: A Nature-Inspired Data Gathering Protocol for Wireless Sensor Networks
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...
S. Selvakennedy, Sukunesan Sinnappan, Yi Shang
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
ATAL
2009
Springer
13 years 5 months ago
Learning to Locate Trading Partners in Agent Networks
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...
John Porter, Kuheli Chakraborty, Sandip Sen
ICPR
2008
IEEE
14 years 2 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato