Sciweavers

9949 search results - page 15 / 1990
» On the Network Complexity of Selection
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
DMSN
2010
ACM
13 years 5 months ago
Processing nested complex sequence pattern queries over event streams
Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These ...
Mo Liu, Medhabi Ray, Elke A. Rundensteiner, Daniel...
COMAD
2009
13 years 8 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
INFOCOM
2011
IEEE
12 years 11 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
LCN
1997
IEEE
13 years 11 months ago
Early Selective Packet Discard for Alternating Resource Access of TCP over ATM-UBR
W e investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the eflective throughput of two existing schemes, Partial Pnwlcet Discard(PPD) ...
Kangsik Cheon, Shivendra S. Panwar