Sciweavers

4843 search results - page 436 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
207
Voted
SECON
2010
IEEE
15 years 2 months ago
Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wol...
147
Voted
JCNS
2010
90views more  JCNS 2010»
14 years 11 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
CONCUR
2012
Springer
13 years 7 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
ICPR
2008
IEEE
16 years 6 months ago
Structural poisson mixtures for classification of documents
Considering the statistical text classification problem we approximate class-conditional probability distributions by structurally modified Poisson mixtures. By introducing the st...
Jana Novovicová, Jiri Grim, Petr Somol
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 5 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen