Sciweavers

1022 search results - page 201 / 205
» Challenges for Constraint Programming in Networking
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
BMCBI
2008
114views more  BMCBI 2008»
15 years 5 months ago
WSPMaker: a web tool for calculating selection pressure in proteins and domains using window-sliding
Background: In the study of adaptive evolution, it is important to detect the protein coding sites where natural selection is acting. In general, the ratio of the rate of non-syno...
Yong Seok Lee, Tae-Hyung Kim, Tae-Wook Kang, Won-H...
147
Voted
JKM
2006
135views more  JKM 2006»
15 years 5 months ago
Learning from the Mars Rover Mission: scientific discovery, learning and memory
Purpose Knowledge management for space exploration is part of a multi-generational effort. Each mission builds on knowledge from prior missions, and learning is the first step in ...
Charlotte Linde
173
Voted
TSP
2010
14 years 11 months ago
Sequential and cooperative sensing for multi-channel cognitive radios
Effective spectrum sensing is a critical prerequisite for multi-channel cognitive radio (CR) networks, where multiple spectrum bands are sensed to identify transmission opportuniti...
Seung-Jun Kim, Georgios B. Giannakis
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 6 months ago
Stop Chasing Trends: Discovering High Order Models in Evolving Data
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
Shixi Chen, Haixun Wang, Shuigeng Zhou, Philip S. ...