Sciweavers

654 search results - page 81 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
KAIS
2008
150views more  KAIS 2008»
13 years 8 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
INFOCOM
2005
IEEE
14 years 2 months ago
TCAM-based distributed parallel packet classification algorithm with range-matching solution
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu
INFOCOM
2006
IEEE
14 years 2 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
AAAI
1990
13 years 10 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
14 years 26 days ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...