Sciweavers

5022 search results - page 418 / 1005
» Data structures and problem solving using Java
Sort
View
IPSN
2009
Springer
15 years 11 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ECCV
2006
Springer
16 years 6 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
ICPR
2000
IEEE
16 years 5 months ago
A Model of Stroke Extraction from Chinese Character Images
Given the large number and complexity of Chinese characters, pattern matching based on structural decomposition and analysis is believed to be necessary and essential to off-line ...
Ruini Cao, Chew Lim Tan
140
Voted
BMCBI
2006
99views more  BMCBI 2006»
15 years 4 months ago
MAGIC-SPP: a database-driven DNA sequence processing package with associated management tools
Background: Processing raw DNA sequence data is an especially challenging task for relatively small laboratories and core facilities that produce as many as 5000 or more DNA seque...
Chun Liang, Feng Sun, Haiming Wang, Junfeng Qu, Ro...
ICPP
2005
IEEE
15 years 9 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann