Sciweavers

4526 search results - page 236 / 906
» Algorithmic problems related to the Internet
Sort
View
WINET
2002
144views more  WINET 2002»
15 years 6 months ago
Exposure in Wireless Sensor Networks: Theory and Practical Solutions
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Gia...
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
16 years 6 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
16 years 1 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
15 years 8 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
DATAMINE
2010
120views more  DATAMINE 2010»
15 years 6 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado