Sciweavers

625 search results - page 50 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
116
Voted
IWANN
2005
Springer
15 years 9 months ago
Input and Structure Selection for k-NN Approximator
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
Antti Sorjamaa, Nima Reyhani, Amaury Lendasse
111
Voted
HOTNETS
2010
14 years 10 months ago
How to tell an airport from a home: techniques and applications
Today's Internet services increasingly use IP-based geolocation to specialize the content and service provisioning for each user. However, these systems focus almost exclusiv...
Andreas Pitsillidis, Yinglian Xie, Fang Yu, Mart&i...
146
Voted
JMLR
2010
157views more  JMLR 2010»
14 years 10 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
132
Voted
CMSB
2009
Springer
15 years 10 months ago
Probabilistic Approximations of Signaling Pathway Dynamics
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
Bing Liu, P. S. Thiagarajan, David Hsu
ICCAD
2008
IEEE
122views Hardware» more  ICCAD 2008»
16 years 11 days ago
Network flow-based power optimization under timing constraints in MSV-driven floorplanning
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...
Qiang Ma, Evangeline F. Y. Young