Sciweavers

683 search results - page 4 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 3 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
ICML
2007
IEEE
14 years 7 months ago
Dynamic hierarchical Markov random fields and their application to web data extraction
Hierarchical models have been extensively studied in various domains. However, existing models assume fixed model structures or incorporate structural uncertainty generatively. In...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
TCOM
2010
133views more  TCOM 2010»
13 years 4 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy
JMLR
2008
159views more  JMLR 2008»
13 years 6 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen