Sciweavers

2526 search results - page 376 / 506
» A New Algorithm for Answer Set Computation
Sort
View
DAC
2000
ACM
16 years 3 months ago
Depth optimal incremental mapping for field programmable gate arrays
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
Jason Cong, Hui Huang
133
Voted
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 2 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
121
Voted
IPSN
2009
Springer
15 years 9 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...
INFOCOM
2009
IEEE
15 years 9 months ago
Passive Loss Inference in Wireless Sensor Networks Based on Network Coding
Abstract—The highly stochastic nature of wireless environments makes it desirable to monitor link loss rates in wireless sensor networks. In this paper, we study the loss inferen...
Yunfeng Lin, Ben Liang, Baochun Li
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 9 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella