Sciweavers

9949 search results - page 87 / 1990
» On the Network Complexity of Selection
Sort
View
UAI
2004
13 years 10 months ago
Algebraic Statistics in Model Selection
We develop the necessary theory in computational algebraic geometry to place Bayesian networks into the realm of algebraic statistics. We present an algebra
Luis David Garcia
APNOMS
2007
Springer
14 years 3 months ago
The Primary Path Selection Algorithm for Ubiquitous Multi-homing Environments
The multi-homing technology can provide an extended coverage area via distinct access technologies. Also, it is able to redirect a flow from one interface to another without reinit...
Dae Sun Kim, Choong Seon Hong
MWCN
2004
Springer
14 years 2 months ago
On Selecting Nodes to Improve Estimated Positions
— We consider node localization problems in ad hoc wireless networks in which two types of nodes are considered: nodes with self-locating capability like GPS and nodes with no se...
Erwan Ermel, Anne Fladenmuller, Guy Pujolle, Andr&...
COMCOM
2006
147views more  COMCOM 2006»
13 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
WWW
2011
ACM
13 years 3 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg