Sciweavers

429 search results - page 35 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
ITIIS
2010
186views more  ITIIS 2010»
13 years 2 months ago
Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN
IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff...
Bum-Gon Choi, Ju Yong Lee, Min Young Chung
ICASSP
2011
IEEE
12 years 11 months ago
Estimation of cortical connectivity from E/MEG using nonlinear state-space models
We present the problem of estimating cortical connectivity between different regions of the cortex from scalp electroencephalographic (EEG) or magnetoencephalographic (MEG) data a...
Bing Leung, Patrick Cheung, Barry D. Van Veen
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 1 months ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb
RECOMB
1997
Springer
13 years 12 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...